21 citations · 71 across the 12 of their papers we have counts for
Showing 2018 · cs.AIShow all
2 papers · 2 filters
cs.AI2018★ 6 cited
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…
cs.AI2018
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…