New records of pre-image search of reduced SHA-1 using SAT solvers
From MaRDI portal
Publication:2079908
Recommendations
Cites work
- scientific article; zbMATH DE number 3877077 (Why is no real title available?)
- Finding Collisions in the Full SHA-1
- From collisions to chosen-prefix collisions application to full SHA-1
- Handbook of knowledge representation.
- Higher-order differential meet-in-the-middle preimage attacks on SHA-1 and BLAKE
- Improved upper bounds for the expected circuit complexity of dense systems of linear equations over \(\mathrm{GF}(2)\)
- Keying hash functions for message authentication
- Meet-in-the-Middle Preimage Attacks Against Reduced SHA-0 and SHA-1
- Optimal speedup of Las Vegas algorithms
- Preimages for Reduced SHA-0 and SHA-1
- Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
- The MathSAT5 SMT solver
- The first collision for full SHA-1
- Theory and Applications of Satisfiability Testing
Cited in
(3)
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)