Search Results for author: Stepan Kochemazov

Found 5 papers, 1 papers with code

On Cryptographic Attacks Using Backdoors for SAT

no code implementations13 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.

Cryptanalysis

Encoding Cryptographic Functions to SAT Using Transalg System

1 code implementation4 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.

Cryptanalysis Distributed Computing

Using synchronous Boolean networks to model several phenomena of collective behavior

no code implementations29 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.

Transalg: a Tool for Translating Procedural Descriptions of Discrete Functions to SAT

no code implementations7 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.

Translation

Cannot find the paper you are looking for? You can Submit a new open access paper.