Using Monte Carlo method for searching partitionings of hard variants of Boolean satisfiability problem

3 July 2015

Papers citing "Using Monte Carlo method for searching partitionings of hard variants of Boolean satisfiability problem"

4 / 4 papers shown

Title
Inverting Cryptographic Hash Functions via Cube-and-Conquer O. Zaikin 40 3 0 05 Dec 2022
Translation of Algorithmic Descriptions of Discrete Functions to SAT with Applications to Cryptanalysis Problems A. Semenov I. Otpuschennikov I. Gribanova O. Zaikin S. Kochemazov 49 16 0 17 May 2018
Using Automatic Generation of Relaxation Constraints to Improve the Preimage Attack on 39-step MD4 I. Gribanova A. Semenov 38 7 0 20 Feb 2018
Encoding Cryptographic Functions to SAT Using Transalg System I. Otpuschennikov A. Semenov I. Gribanova O. Zaikin S. Kochemazov 49 27 0 04 Jul 2016