Cryptanalysis of the hash functions MD4 and RIPEMD

DMCA

Cryptanalysis of the hash functions MD4 and RIPEMD (2005)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Xiaoyun Wang , Xuejia Lai , Dengguo Feng , Hui Chen , Xiuyuan Yu

Venue:	In Proceedings of Eurocrypt ’05, volume 3494 of LNCS
Citations:	32 - 0 self

BibTeX

@INPROCEEDINGS{Wang05cryptanalysisof,
    author = {Xiaoyun Wang and Xuejia Lai and Dengguo Feng and Hui Chen and Xiuyuan Yu},
    title = {Cryptanalysis of the hash functions MD4 and RIPEMD},
    booktitle = {In Proceedings of Eurocrypt ’05, volume 3494 of LNCS},
    year = {2005},
    pages = {1--18},
    publisher = {Springer-Verlag}
}

OpenURL

Abstract

Abstract. MD4 is a hash function developed by Rivest in 1990. It serves as the basis for most of the dedicated hash functions such as MD5, SHAx, RIPEMD, and HAVAL. In 1996, Dobbertin showed how to find collisions of MD4 with complexity equivalent to 2 20 MD4 hash computations. In this paper, we present a new attack on MD4 which can find a collision with probability 2 −2 to 2 −6, and the complexity of finding a collision doesn’t exceed 2 8 MD4 hash operations. Built upon the collision search attack, we present a chosen-message pre-image attack on MD4 with complexity below 2 8. Furthermore, we show that for a weak message, we can find another message that produces the same hash value. The complexity is only a single MD4 computation, and a random message is a weak message with probability 2 −122. The attack on MD4 can be directly applied to RIPEMD which has two parallel copies of MD4, and the complexity of finding a collision is about 2 18 RIPEMD hash operations. 1

Keyphrases

hash function md4 weak message hash value chosen-message pre-image attack md4 hash operation new attack hash function collision doesn random message complexity equivalent single md4 computation dedicated hash function parallel copy md4 hash computation ripemd hash operation collision search attack

DMCA