Topic summary
SHA-0
Extracted from the Wikipedia article SHA-1.
SHA-0
At CRYPTO 98, two French researchers, Florent Chabaud and Antoine Joux, presented an attack on SHA-0: collisions can be found with complexity 2, fewer than the 2 for an ideal hash function of the same size.