New records of pre-image search of reduced SHA-1 using SAT solvers
DOI10.1007/978-981-16-6890-6_11zbMATH Open1498.94053OpenAlexW4225974597MaRDI QIDQ2079908FDOQ2079908
Authors: Alessandro De Piccoli, Sergio Polese, Lorenzo Riva, Andrea Visconti, Emanuele Bellini, Rusydi H. Makarim
Publication date: 7 October 2022
Full work available at URL: https://doi.org/10.1007/978-981-16-6890-6_11
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)
Cites Work
- Theory and Applications of Satisfiability Testing
- The MathSAT5 SMT solver
- Handbook of knowledge representation.
- Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
- Optimal speedup of Las Vegas algorithms
- Keying hash functions for message authentication
- Finding Collisions in the Full SHA-1
- Preimages for Reduced SHA-0 and SHA-1
- Title not available (Why is that?)
- Meet-in-the-Middle Preimage Attacks Against Reduced SHA-0 and SHA-1
- 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
- Higher-order differential meet-in-the-middle preimage attacks on SHA-1 and BLAKE
Cited In (3)
Uses Software
This page was built for publication: New records of pre-image search of reduced SHA-1 using SAT solvers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2079908)