In this paper, we present new techniques for collision search in the hash function SHA-0. Using the new techniques, we can find collisions of the full 80-step SHA-0 with complexity less than 239 hash operations.
['Xiaoyun Wang', 'Hongbo Yu', 'Yiqun Lisa Yin']
Efficient collision search attacks on SHA-0