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 abo 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. © International Association for Cryptologic Research 2004.
Cite
CITATION STYLE
Biham, E., & Chen, R. (2004). Near-collisions of SHA-0. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3152, 290–305. https://doi.org/10.1007/978-3-540-28628-8_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
