On Cryptographic Attacks Using Backdoors for SAT

Alexander Semenov, Oleg Zaikin, Ilya Otpuschennikov +2

Propositional satisfiability (SAT) is at the nucleus of state-of-the-art approaches to a variety of computationally hard problems, one of which is cryptanalysis. Moreover, a number…