AN ATTACK ON THE LAST 2 ROUNDS OF MD4

被引：0

作者：

DENBOER, B ^{[1
]}

BOSSELAERS, A ^{[1
]}

机构：

[1] KU LEUVEN, ESAT LAB, B-3001 HEVERLEE, BELGIUM

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1992年 / 576卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

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.

引用

页码：194 / 203

页数：10