### Near-Collisions of SHA-0

Eli Biham and Rafi Chen

##### 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.

##### Metadata
Available format(s)
Category
Secret-key cryptography
Publication info
Published elsewhere. Breaking News'' information on SHA-0 and SHA-1 was added to our CRYPTO 2004 paper
Keywords
SHA-0SHA-1
Contact author(s)
biham @ cs technion ac il
History
2004-06-23: received
Short URL
https://ia.cr/2004/146
License

CC BY

BibTeX

@misc{cryptoeprint:2004/146,
author = {Eli Biham and Rafi Chen},
title = {Near-Collisions of SHA-0},
howpublished = {Cryptology ePrint Archive, Paper 2004/146},
year = {2004},
note = {\url{https://eprint.iacr.org/2004/146}},
url = {https://eprint.iacr.org/2004/146}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.