21 citations · 33 across the 5 of their papers we have counts for
5 papers
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…
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…
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…
Using Volunteer Computing for Mounting SAT-based Cryptographic Attacks
Alexander Semenov, Oleg Zaikin, Ilya Otpuschennikov
In this paper we describe the volunteer computing project SAT@home, developed and maintained by us. This project is aimed at solving hard instances of the Boolean satisfiability pr…
Transalg: a Tool for Translating Procedural Descriptions of Discrete Functions to SAT
Ilya Otpuschennikov, Alexander Semenov, Stepan Kochemazov
In this paper we present the Transalg system, designed to produce SAT encodings for discrete functions, written as programs in a specific language. Translation of such programs to…