21 citations · 22 across the 2 of their papers we have counts for
3 papers
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…
Fast Algorithm for Enumerating Diagonal Latin Squares of Small Order
Stepan Kochemazov, Eduard Vatutin, Oleg Zaikin
In this paper we propose an algorithm for enumerating diagonal Latin squares of small order. It relies on specific properties of diagonal Latin squares to employ symmetry breaking…
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…