21 citations · 25 across the 2 of their papers we have counts for
3 papers · 1 filter
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…
Using Automatic Generation of Relaxation Constraints to Improve the Preimage Attack on 39-step MD4
Irina Gribanova, Alexander Semenov
In this paper we construct preimage attack on the truncated variant of the MD4 hash function. Specifically, we study the MD4-39 function defined by the first 39 steps of the MD4 al…
Encoding Cryptographic Functions to SAT Using Transalg System
Ilya Otpuschennikov, Alexander Semenov, Irina Gribanova +2
In this paper we propose the technology for constructing propositional encodings of discrete functions. It is aimed at solving inversion problems of considered functions using stat…