Preimages for Step-Reduced SHA-2
Authors:
- 1 January 2009
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- Vol. 2009, 578-597
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Finding Preimages in Full MD5 Faster Than Exhaustive Search2009
- Preimage Attacks on Reduced Tiger and SHA-2Lecture Notes in Computer Science, 2009
- Preimage Attacks on One-Block MD4, 63-Step MD5 and More2009
- Collisions and Other Non-random Properties for Step-Reduced SHA-256Lecture Notes in Computer Science, 2009
- MD4 is Not One-Way2008
- Collisions for Step-Reduced SHA-256Lecture Notes in Computer Science, 2008
- New Collision Attacks against Up to 24-Step SHA-22008
- A Meet-in-the-Middle Collision Attack Against the New FORK-256Lecture Notes in Computer Science, 2007
- Analysis of Step-Reduced SHA-256Lecture Notes in Computer Science, 2006
- Finding Collisions in the Full SHA-12005