21 citations · 71 across the 12 of their papers we have counts for
12 papers
Efficient Parallel Algorithm for Decomposing Hard CircuitSAT Instances
Victor Kondratiev, Irina Gribanova, Alexander Semenov
We propose a novel parallel algorithm for decomposing hard CircuitSAT instances. The technique employs specialized constraints to partition an original SAT instance into a family o…
Merging variables: one technique of search in pseudo-Boolean optimization
Alexander A. Semenov
In the present paper we describe new heuristic technique, which can be applied to the optimization of pseudo-Boolean functions including Black-Box functions. This technique is base…
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…
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…