Efficient Collision Search Attacks on SHA-0

By Xiaoyun Wang, Hongbo Yu, Yiqun Lisa Yin. Annual International Cryptology Conference, 2005

452 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

The First Collision for Full SHA-1 (2017, background): “from the mid-2000s [43, 44, 42], but have widely varying complexities.”
Finding SHA-1 Characteristics: General Results and Applications (2006, background): “[20, 22] describe further major improvements.”
Finding Collisions in the Full SHA-1 (2005, methodology): “Most details can be found in our analysis of SHA-0 [ 16 ], and hence are omitted.”
Secure Hybrid Encryption from Weakened Key Encapsulation (2007, methodology): “So as long as one does not want to sacrifice provable security by implementing the TCR function with a dedicated hash function like SHA-x or MD5 (what potentially renders the whole scheme insecure given the recent progress in attacking certain hash functions [38, 39]), one must either resort to inef”