Applications of SAT Solvers in Cryptanalysis: Finding Weak Keys and Preimages
Frédéric Lafitte, Jorge Nakahara, Dirk Van Heule · Journal on Satisfiability Boolean Modeling and Computation · 2014
This paper investigates the power of SAT solvers in cryptanalysis. The contributions are two-fold and are relevant to both theory and practice. First, we introduce an efficient, generic and automated method for generating SAT instances encoding a wid