International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Near-Collisions of SHA-0

Authors:
Eli Biham
Rafi Chen
Download:
URL: http://eprint.iacr.org/2004/146
Search ePrint
Search Google
Abstract: In this paper we find two near-collisions of the full compression function of SHA-0, in which up to 142 of the 160 bits of the output are equal. We also find many full collisions of 65-round reduced SHA-0, which is a large improvement to the best previous result of 35 rounds. We use the very surprising fact that the messages have many neutral bits, some of which do not affect the differences for about 15--20 rounds. We also show that 82-round SHA-0 is much weaker than the (80-round) SHA-0, although it has more rounds. This fact demonstrates that the strength of SHA-0 is not monotonous in the number of rounds.
BibTeX
@misc{eprint-2004-12118,
  title={Near-Collisions of SHA-0},
  booktitle={IACR Eprint archive},
  keywords={secret-key cryptography / SHA-0, SHA-1},
  url={http://eprint.iacr.org/2004/146},
  note={``Breaking News'' information on SHA-0 and SHA-1 was added to our CRYPTO 2004 paper biham@cs.technion.ac.il 12591 received 22 Jun 2004},
  author={Eli Biham and Rafi Chen},
  year=2004
}