Paper 2005/102

Finding MD5 Collisions on a Notebook PC Using Multi-message Modifications

Vlastimil Klima

Abstract

In this paper, we summarize the results achieved during our brief three months long research on collisions of the MD5 hash function. Being inspired by the results announced by Wang et al. [1] we independently developed methods for finding collisions which work for any initialization value and which are quicker than the methods presented in [1, 8]. It enables us to find a MD5 collision on a standard notebook PC roughly in 8 hours [7]. Independently on [1, 8], we discovered and propose several multi-message modification methods, which are more effective than methods described in [1, 8]. We show their principle.

Metadata
Available format(s)
PDF
Category
Secret-key cryptography
Publication info
Published elsewhere. will be presented at 3rd International Scientific Conference Security and Protection of Information, Brno, Czech Republic, May 3 - 5, 2005
Keywords
MD5collisionmulti-message modificationhash function
Contact author(s)
v klima @ volny cz
History
2005-04-05: received
Short URL
https://ia.cr/2005/102
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2005/102,
      author = {Vlastimil Klima},
      title = {Finding MD5 Collisions on a Notebook PC Using Multi-message Modifications},
      howpublished = {Cryptology ePrint Archive, Paper 2005/102},
      year = {2005},
      note = {\url{https://eprint.iacr.org/2005/102}},
      url = {https://eprint.iacr.org/2005/102}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.