Pushing the limit of memory-efficient collision attack framework for \textsf{SHA-2}
From MaRDI portal
Publication:7443552
Cites work
- Analysis of RIPEMD-160: new collision attacks and finding characteristics with MILP
- Analysis of SHA-512/224 and SHA-512/256
- Analysis of Step-Reduced SHA-256
- Attacking Reduced Round SHA-256
- Branching heuristics in differential collision search with applications to SHA-512
- Collision attacks on SHA-256 up to 37 steps with improved trail search
- Collisions and Other Non-random Properties for Step-Reduced SHA-256
- Collisions for Step-Reduced SHA-256
- Cryptanalysis of full RIPEMD-128
- Cryptanalysis of the Hash Functions MD4 and RIPEMD
- Efficient Collision Search Attacks on SHA-0
- Finding Collisions in the Full SHA-1
- Finding SHA-2 characteristics: searching through a minefield of contradictions
- How to Break MD5 and Other Hash Functions
- scientific article; zbMATH DE number 4195165 (Why is no real title available?)
- Improved semi-free-start collision attacks on RIPEMD-160
- Improving local collisions: new attacks on reduced SHA-256
- New collision attacks on round-reduced \textsf{SHA-512}
- New records in collision attacks on SHA-2
- One Way Hash Functions and DES
- The first collision for full SHA-1
- The first practical collision for 31-step SHA-256
This page was built for publication: Pushing the limit of memory-efficient collision attack framework for \textsf{SHA-2}
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7443552)