The SAT solving method as applied to cryptographic analysis of asymmetric ciphers

R. T. Faizullin, I. G. Khnykin, V. I. Dylkeyt

The one of the most interesting problem of discrete mathematics is the SAT (satisfiability) problem. Good way in SAT solver developing is to transform the SAT problem to the proble…