Encoding Cryptographic Functions to SAT Using Transalg System
Not on the map. Why?
Abstract (arXiv)
In this paper we propose the technology for constructing propositional encodings of discrete functions. It is aimed at solving inversion problems of considered functions using state-of-the-art SAT solvers. 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. By applying SAT solvers to these encodings we managed to invert several cryptographic functions. In particular, we used the SAT encodings produced by Transalg to construct the family of two-block MD5 collisions in which the first 10 bytes are zeros. Also we used Transalg encoding for the widely known A5/1 keystream generator to solve several dozen of its cryptanalysis instances in a distributed computing environment. In the paper we compare in detail the functionality of Transalg with that of similar software systems.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 4 Jul 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1.
2 papers.
- 2021ML Supported Predictions for SAT Solvers Performancecited by 1
- 2022Inverting Cryptographic Hash Functions via Cube-and-Conquercited by 1
- 2022Inverting Cryptographic Hash Functions via Cube-and-Conquer5 Dec 2022
- 2021ML Supported Predictions for SAT Solvers Performance17 Dec 2021