Finding Preimages in Full MD5 Faster Than Exhaustive Search
Authors:
- 1 January 2009
- book chapter
- Published by Springer Nature
- p. 134-152
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Preimage Attacks on One-Block MD4, 63-Step MD5 and More2009
- MD4 is Not One-Way2008
- Preimage Attacks on 3, 4, and 5-Pass HAVAL2008
- Preimage Attacks on Step-Reduced MD5Lecture Notes in Computer Science, 2008
- Preimages for Reduced SHA-0 and SHA-12008
- Inversion Attacks on Secure Hash Functions Using sat Solvers2007
- Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work2005
- How to Break MD5 and Other Hash Functions2005
- Collisions for the compression function of MD51994
- The MD5 Message-Digest Algorithm1992