MD4
Contents
1 Specification
- digest size: 128 bits
- max. message length: < 264 bits
- compression function: 512-bit message block, 128-bit chaining variable
- Specification: RFC1320
Ronald L. Rivest - The MD4 Message Digest Algorithm
- CRYPTO 537:303-311,1990
- http://link.springer.de/link/service/series/0558/bibs/0537/05370303.htm
BibtexAuthor : Ronald L. Rivest
Title : The MD4 Message Digest Algorithm
In : CRYPTO -
Address :
Date : 1990
2 Cryptanalysis
2.1 Best Known Results
2.2 Generic Attacks
2.3 Collision Attacks
Hongbo Yu, Xiaoyun Wang - Multi-collision Attack on the Compression Functions of MD4 and 3-Pass HAVAL
- ICISC 4817:206-226,2007
- http://dx.doi.org/10.1007/978-3-540-76788-6_17
BibtexAuthor : Hongbo Yu, Xiaoyun Wang
Title : Multi-collision Attack on the Compression Functions of MD4 and 3-Pass HAVAL
In : ICISC -
Address :
Date : 2007
Yu Sasaki, Lei Wang, Kazuo Ohta, Noboru Kunihiro - New Message Difference for MD4
- FSE 4593:329-348,2007
- http://dx.doi.org/10.1007/978-3-540-74619-5_21
BibtexAuthor : Yu Sasaki, Lei Wang, Kazuo Ohta, Noboru Kunihiro
Title : New Message Difference for MD4
In : FSE -
Address :
Date : 2007
Gaëtan Leurent - Message Freedom in MD4 and MD5 Collisions: Application to APOP
- FSE 4593:309-328,2007
- http://dx.doi.org/10.1007/978-3-540-74619-5_20
BibtexAuthor : Gaëtan Leurent
Title : Message Freedom in MD4 and MD5 Collisions: Application to APOP
In : FSE -
Address :
Date : 2007
Yusuke Naito, Yu Sasaki, Noboru Kunihiro, Kazuo Ohta - Improved Collision Attack on MD4 with Probability Almost 1
- ICISC 3935:129-145,2005
- http://dx.doi.org/10.1007/11734727_12
BibtexAuthor : Yusuke Naito, Yu Sasaki, Noboru Kunihiro, Kazuo Ohta
Title : Improved Collision Attack on MD4 with Probability Almost 1
In : ICISC -
Address :
Date : 2005
Xiaoyun Wang, Xuejia Lai, Dengguo Feng, Hui Chen, Xiuyuan Yu - Cryptanalysis of the Hash Functions MD4 and RIPEMD
- EUROCRYPT 3494:1-18,2005
- http://dx.doi.org/10.1007/11426639_1
BibtexAuthor : Xiaoyun Wang, Xuejia Lai, Dengguo Feng, Hui Chen, Xiuyuan Yu
Title : Cryptanalysis of the Hash Functions MD4 and RIPEMD
In : EUROCRYPT -
Address :
Date : 2005
Hans Dobbertin - Cryptanalysis of MD4
- J. Cryptology 11(4):253-271,1998
- http://link.springer.de/link/service/journals/00145/bibs/11n4p253.html
BibtexAuthor : Hans Dobbertin
Title : Cryptanalysis of MD4
In : J. Cryptology -
Address :
Date : 1998
Hans Dobbertin - Cryptanalysis of MD4
- FSE 1039:53-69,1996
- http://dx.doi.org/10.1007/s001459900047
BibtexAuthor : Hans Dobbertin
Title : Cryptanalysis of MD4
In : FSE -
Address :
Date : 1996
Serge Vaudenay - On the Need for Multipermutations: Cryptanalysis of MD4 and SAFER
- FSE 1008:286-297,1995
- http://dx.doi.org/10.1007/3-540-60590-8_22
BibtexAuthor : Serge Vaudenay
Title : On the Need for Multipermutations: Cryptanalysis of MD4 and SAFER
In : FSE -
Address :
Date : 1995
Bert den Boer, Antoon Bosselaers - An Attack on the Last Two Rounds of MD4
- CRYPTO 576:194-203,1991
- http://link.springer.de/link/service/series/0558/bibs/0576/05760194.htm
BibtexAuthor : Bert den Boer, Antoon Bosselaers
Title : An Attack on the Last Two Rounds of MD4
In : CRYPTO -
Address :
Date : 1991
2.4 Second Preimage Attacks
2.5 Preimage Attacks
Ga\"etan Leurent - MD4 is Not One-Way
- FSE 5086:412-428,2008
- http://dx.doi.org/10.1007/978-3-540-71039-4_26
BibtexAuthor : Ga\"etan Leurent
Title : MD4 is Not One-Way
In : FSE -
Address :
Date : 2008
Hans Dobbertin - The First Two Rounds of MD4 are Not One-Way
- FSE 1372:284-292,1998
- http://dx.doi.org/10.1007/3-540-69710-1_19
BibtexAuthor : Hans Dobbertin
Title : The First Two Rounds of MD4 are Not One-Way
In : FSE -
Address :
Date : 1998
2.6 Others
<bibtex> @inproceedings{fseSchlafferO06,
author = {Martin Schläffer and Elisabeth Oswald}, title = {Searching for Differential Paths in MD4}, pages = {242-261}, url = {http://dx.doi.org/10.1007/11799313_16}, booktitle = {FSE}, publisher = {Springer}, series = {LNCS}, volume = {4047}, year = {2006}, isbn = {3-540-36597-4}, abstract = {The ground-breaking results of Wang et al.
have attracted a lot of attention to the collision resistance of hash functions. In their articles, Wang et al. give input differences, differential paths and the corresponding conditions that allow to find collisions with a high probability. However, Wang et al. do not explain how these paths were found. The common assumption is that they were found by hand with a great deal of intuition. In this article, we present an algorithm that allows to find paths in an automated way. Our algorithm is successful for MD4. We have found over 1000 differential paths so far. Amongst them, there are paths that have fewer conditions in the second round than the path of Wang et al. for MD4. This makes them better suited for the message modification techniques that were also introduced by Wang et al.} }