21 citations · 33 across the 5 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.LO2018★ 6 cited
Translation of Algorithmic Descriptions of Discrete Functions to SAT with Applications to Cryptanalysis Problems
Alexander Semenov, Ilya Otpuschennikov, Irina Gribanova +2
In the present paper, we propose a technology for translating algorithmic descriptions of discrete functions to SAT. The proposed technology is aimed at applications in algebraic c…
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…