New records of pre-image search of reduced SHA-1 using SAT solvers

DOI10.1007/978-981-16-6890-6_11zbMath1498.94053OpenAlexW4225974597MaRDI QIDQ2079908

Sergio Polese, Alessandro De Piccoli, Lorenzo Riva, Andrea Visconti, Rusydi H. Makarim, Emanuele Bellini

Publication date: 7 October 2022

Full work available at URL: https://doi.org/10.1007/978-981-16-6890-6_11

zbMATH Keywords

SAT solverpre-imageSHA-1

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Uses Software

• MiniSat
• Yices
• MathSAT5
• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal speedup of Las Vegas algorithms
• Improved upper bounds for the expected circuit complexity of dense systems of linear equations over \(\mathrm{GF}(2)\)
• The first collision for full SHA-1
• From collisions to chosen-prefix collisions application to full SHA-1
• Meet-in-the-Middle Preimage Attacks Against Reduced SHA-0 and SHA-1
• Keying Hash Functions for Message Authentication
• Higher-Order Differential Meet-in-the-middle Preimage Attacks on SHA-1 and BLAKE
• Preimages for Reduced SHA-0 and SHA-1
• Theory and Applications of Satisfiability Testing
• The MathSAT5 SMT Solver
• Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
• Finding Collisions in the Full SHA-1

This page was built for publication: New records of pre-image search of reduced SHA-1 using SAT solvers