skip to main content
10.1007/978-3-642-04159-4_7guidebooksArticle/Chapter ViewAbstractPublication PagesBookacm-pubtype
chapter

Preimage Attacks on One-Block MD4, 63-Step MD5 and More

Published: 23 August 2009 Publication History

Abstract

This paper shows preimage attacks on one-block MD4 and MD5 reduced to 63 (out of 64) steps. Our attacks are based on the meet-in-the-middle attack, and many additional improvements make the preimage computable faster than that of the brute-force attack, 2128 hash computation. A preimage of one-block MD4 can be computed in the complexity of the 2107 MD4 compression function computation, and a preimage of MD5 reduced to 63 steps can be computed in the complexity of the 2121 MD5 compression function computation. Moreover, we optimize the computational order of the brute-force attack against MD5, and a preimage of full-round MD5 can be computed in the complexity of the 2127 MD5 compression function computation.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Guide books
Selected Areas in Cryptography: 15th International Workshop, SAC 2008, Sackville, New Brunswick, Canada, August 14-15, Revised Selected Papers
August 2009
456 pages
ISBN:9783642041587
  • Editors:
  • Roberto Maria Avanzi,
  • Liam Keliher,
  • Francesco Sica

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 23 August 2009

Author Tags

  1. MD4
  2. MD5
  3. local collision
  4. meet-in-the-middle
  5. one-way
  6. preimage

Qualifiers

  • Chapter

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 01 Feb 2025

Other Metrics

Citations

Cited By

View all

View Options

View options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media