Picture for Oleg Zaikin

Oleg Zaikin

Inverting Cryptographic Hash Functions via Cube-and-Conquer

Add code
Dec 05, 2022
Viaarxiv icon

Translation of Algorithmic Descriptions of Discrete Functions to SAT with Applications to Cryptanalysis Problems

Add code
May 17, 2018
Figure 1 for Translation of Algorithmic Descriptions of Discrete Functions to SAT with Applications to Cryptanalysis Problems
Figure 2 for Translation of Algorithmic Descriptions of Discrete Functions to SAT with Applications to Cryptanalysis Problems
Figure 3 for Translation of Algorithmic Descriptions of Discrete Functions to SAT with Applications to Cryptanalysis Problems
Figure 4 for Translation of Algorithmic Descriptions of Discrete Functions to SAT with Applications to Cryptanalysis Problems
Viaarxiv icon

On Cryptographic Attacks Using Backdoors for SAT

Add code
Mar 13, 2018
Figure 1 for On Cryptographic Attacks Using Backdoors for SAT
Viaarxiv icon

Encoding Cryptographic Functions to SAT Using Transalg System

Add code
Jul 04, 2016
Figure 1 for Encoding Cryptographic Functions to SAT Using Transalg System
Figure 2 for Encoding Cryptographic Functions to SAT Using Transalg System
Figure 3 for Encoding Cryptographic Functions to SAT Using Transalg System
Figure 4 for Encoding Cryptographic Functions to SAT Using Transalg System
Viaarxiv icon

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

Add code
Jul 03, 2015
Figure 1 for Using Monte Carlo method for searching partitionings of hard variants of Boolean satisfiability problem
Figure 2 for Using Monte Carlo method for searching partitionings of hard variants of Boolean satisfiability problem
Figure 3 for Using Monte Carlo method for searching partitionings of hard variants of Boolean satisfiability problem
Figure 4 for Using Monte Carlo method for searching partitionings of hard variants of Boolean satisfiability problem
Viaarxiv icon

On estimating total time to solve SAT in distributed computing environments: Application to the SAT@home project

Add code
Aug 04, 2013
Figure 1 for On estimating total time to solve SAT in distributed computing environments: Application to the SAT@home project
Figure 2 for On estimating total time to solve SAT in distributed computing environments: Application to the SAT@home project
Figure 3 for On estimating total time to solve SAT in distributed computing environments: Application to the SAT@home project
Figure 4 for On estimating total time to solve SAT in distributed computing environments: Application to the SAT@home project
Viaarxiv icon