• Corpus ID: 207836753

MD5 and SHA-1 Collision Attacks: A Tutorial

@inproceedings{Savage2008MD5AS,
  title={MD5 and SHA-1 Collision Attacks: A Tutorial},
  author={Alan Savage},
  year={2008}
}
MD5 and SHA-1 are well developed and popular cryptographic hash functions used for various security purposes, including password storage and integrity checking. Both of these algorithms have been shown to be vulnerable to collisions. In this tutorial, collision attacks for both of these algorithms will be presented and analyzed. In addition, the implications of these attacks on the development of future hash functions will be discussed. 

Figures and Tables from this paper

References

SHOWING 1-8 OF 8 REFERENCES
Finding Collisions in the Full SHA-1
TLDR
This is the first attack on the full 80-step SHA-1 with complexity less than the 280 theoretical bound, and it is shown that collisions ofSHA-1 can be found with complexityLess than 269 hash operations.
How to Break MD5 and Other Hash Functions
TLDR
A new powerful attack on MD5 is presented, which unlike most differential attacks, does not use the exclusive-or as a measure of difference, but instead uses modular integer subtraction as the measure.
Notes on the Wang et al. 263 SHA-1 Differential Path
  • Martin Cochran
  • Mathematics, Computer Science
    IACR Cryptol. ePrint Arch.
  • 2007
TLDR
A method is given which yields a two-block collision attack on SHA-1 requiring an estimated 262SHA-1 computations if the original error analysis by Wang et al. is correct.
A Study of the MD5 Attacks: Insights and Improvements
TLDR
A study of all attacks on MD5 starting from Wang, which explains the techniques used by her team, insights on how to improve these techniques, and uses these insights to produce an even faster attack onMD5.
Finding MD5 Collisions on a Notebook PC Using Multi-message Modifications
TLDR
This paper independently developed methods for finding collisions of the MD5 hash function which work for any initialization value and which are quicker than the methods presented in [1, 8].
Improved Collision Attack on Hash Function MD5
TLDR
It’s time to get ready for EuroOCRYPT 2005 again, this time with a vengeance.
The MD 5 Message - Digest Algorithm , ” RFC 1321 ( Informational ) , Apr . 1992 . [ 2 ] “ Wikipedia
    Cryptanalysis of sha-1 hash function
    • NIST Cryptographic Hash Workshop, 2005.
    • 2005