Search Results for author:
Found 6 papers, 1 papers with code
Inverting Cryptographic Hash Functions via Cube-and-Conquer
In this study, 40-, 41-, 42-, and 43-step MD4 are inverted for the first time via the first algorithm and the estimating mode of the second algorithm.
Translation of Algorithmic Descriptions of Discrete Functions to SAT with Applications to Cryptanalysis Problems
We demonstrate the results of applications of Transalg to construction of a number of attacks on various cryptographic functions.
On Cryptographic Attacks Using Backdoors for SAT
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.
Encoding Cryptographic Functions to SAT Using Transalg System
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.
Using Monte Carlo method for searching partitionings of hard variants of Boolean satisfiability problem
The estimation of effectiveness of the particular partitioning is the value of predictive function in the corresponding point of this space.
On estimating total time to solve SAT in distributed computing environments: Application to the SAT@home project
This paper proposes a method to estimate the total time required to solve SAT in distributed environments via partitioning approach.
