no code implementations • 17 May 2018 • Alexander Semenov, Ilya Otpuschennikov, Irina Gribanova, Oleg Zaikin, Stepan Kochemazov
We demonstrate the results of applications of Transalg to construction of a number of attacks on various cryptographic functions.
no code implementations • 13 Mar 2018 • Alexander Semenov, Oleg Zaikin, Ilya Otpuschennikov, Stepan Kochemazov, Alexey Ignatiev
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.
1 code implementation • 4 Jul 2016 • Ilya Otpuschennikov, Alexander Semenov, Irina Gribanova, Oleg Zaikin, Stepan Kochemazov
We implemented this technology in the form of the software system called Transalg, and used it to construct SAT encodings for a number of cryptanalysis problems.
no code implementations • 29 Oct 2014 • Stepan Kochemazov, Alexander Semenov
The first problem is to find a disposition of instigators that in several time moments transforms a network from a state where a majority of simple agents are inactive to a state with a majority of active agents.
no code implementations • 7 May 2014 • 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.