Title: An attack on the last two rounds of MD4
Authors: Den Boer, Bert
Bosselaers, Antoon
Issue Date: 1992
Publisher: Springer-Verlag
Host Document: Lecture Notes in Computer Science vol:576 pages:194-203
Conference: CRYPTO 1991 date:August 11-15, 1991
Abstract: In [Rive90] the MD4 message digest algorithm was introduced taking an input message of arbitrary length and producing an output 128-bit message digest. It is conjectured that it is computationally infeasible to produce two messages having the same message digest, or to produce any message having a given prespecified target message. In this paper it is shown that if the three round MD4 algorithm is stripped of its first round, it is possible to find for a given (initial) input value two different messages hashing to the same output. A computer program implementing this attack takes about 1 millisecond on a 16 Mhs IBM PS/2 to find such a collision.
ISSN: 0302-9743
Publication status: published
KU Leuven publication type: IC
Appears in Collections:ESAT - STADIUS, Stadius Centre for Dynamical Systems, Signal Processing and Data Analytics

Files in This Item:
File Status SizeFormat
article-130.pdf Published 158KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science