Fitness comparison by statistical testing in construction of SAT-based guess-and-determine cryptographic attacks
Artem Pavlenko, Maxim Buzdalov, Vladimir I. Ulyantsev · Proceedings of the Genetic and Evolutionary Computation Conference · 2019
Algebraic cryptanalysis studies breaking ciphers by solving algebraic equations. Some of the promising approaches use SAT solvers for this purpose. Although the corresponding satisfiability problems are hard, their difficulty can often be lowered by choosing a set of variables to brute force over, and by solving each of the corresponding reduced problems using a SAT solver, which is called the guess-and-determine attack. In many successful cipher breaking attempts this set was chosen analytically, however, the nature of the problem makes evolutionary computation a good choice.