Abstract
In [1] it was shown that there are very effective attacks leading to collisions for the hash function MD4 designed by R. Rivest [3]. A summary of the status of hash functions of the MD4-family with respect to collision-resistence can be found in [2] and [4]. However, attacking the one-wayness of a hash function is a much more demanding challenge, and in case of success it has much more devastating consequences. No result along this line is known for MD4 and its successors. Therefore it is worth to explore how the recently developed new analytic methods for finding collisions can be applied to construct preimages or second preimages. As a first step, we state here the following partial result.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
H. Dobbertin, Cryptanalysis of MD4, Fast Software Encryption (Third Workshop on Cryptographic Algorithms, Cambridge 1996), Lecture Notes in Computer Science, Springer-Verlag 1996, pp. 55–72.
H. Dobbertin, The status of MD5 after a recent attack, CryptoBytes, The technical newsletter of RSA Laboratories, vol. 2/2, Sommer 1996, pp. 1–6.
R. Rivest, The MD4 message-digest algorithm, Request for Comments (RFC) 1320, Internet Activities Board, Internet Privacy Task Force, April 1992.
M.J.B. Robshaw, On recent results for MD2, MD4 and MD5, Bulletin 4, RSA Laboratories, November 1996 (see http://www.rsa.com/PUBS/).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dobbertin, H. (1998). The First Two Rounds of MD4 are Not One-Way. In: Vaudenay, S. (eds) Fast Software Encryption. FSE 1998. Lecture Notes in Computer Science, vol 1372. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-69710-1_19
Download citation
DOI: https://doi.org/10.1007/3-540-69710-1_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64265-7
Online ISBN: 978-3-540-69710-7
eBook Packages: Springer Book Archive