Cryptanalysis of the Hash Functions MD4 and RIPEMD

By Xiaoyun Wang, Xuejia Lai, Dengguo Feng, Hui Chen, Xiu-gui Yu. International Conference on the Theory and Application of Cryptographic Techniques, 2005

502 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition

View Paper: https://www.semanticscholar.org/paper/45a2ce8717638071073477dbd0b535b7c87b220b

How researchers see this paper

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

In Artificial Intelligence

In Computer Vision and Pattern Recognition

Citations in the corpus

Finding SHA-1 Characteristics: General Results and Applications (2006, methodology): “Wang et al. describe in their seminal paper [20] an approach which is based on following and manipulating differences manually [23] in combination with a great deal of experience and intuition.”
The Skein Hash Function Family (2009, background): “The most commonly used hash functions are those of the SHA family: SHA-0 [80], SHA-1 [81], SHA-256, and SHA-512 [83], all based on MD4 [93] and MD5 [94].”
Generalized Compact Knapsacks Are Collision Resistant (2006, methodology): “With current hash functions that are not based on any hardness assumptions, but used in practice, being broken [ 23 , 24, 4], we believe that it may be an appropriate time to consider using efficient hash functions which do have an underlying hardness assumption, especially worst-case ones.”
Efficient Collision Search Attacks on SHA-0 (2005, methodology): “In Section 4, we review the “message modification techniques” presented in [11,12, 13 ] to break HAVA-128, MD5, MD4 and RIPEMD, and consider their effectiveness in improving existing attacks on SHA-0.”
SWIFFT: A Modest Proposal for FFT Hashing (2008, background): “Recently, new cryptanalytic techniques [ 29 ,30,4] have started casting serious doubts both on the security of these specific functions and on the e"ectiveness of the underlying design paradigm.”
Finding Collisions in the Full SHA-1 (2005, methodology): “No.90304009) and Program for New Century Excellent Talents in University SHA-0 [14], the near collision attack on SHA-0 [1], the multi-block collision techniques [12], as well as the message modification techniques used in the collision search attacks on HAVAL-128, MD4, RIPEMD and MD5 [11, 13 ,12].”