计算机工程与应用 ›› 2011, Vol. 47 ›› Issue (9): 112-114.

• 网络、通信、安全 • 上一篇    下一篇

MD-4原象攻击的分析与改进

阎 娜1,2,李梦东2,陈少晖1,2   

  1. 1.西安电子科技大学 通信工程学院,西安 710071
    2.北京电子科技学院 信息安全系,北京 100070
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2011-03-21 发布日期:2011-03-21

Analysis and improvement of preimage attack on MD-4

YAN Na1,2,LI Mengdong2,CHEN Shaohui1,2   

  1. 1.School of Communication Engineering,Xidian University,Xi’an 710071,China
    2.Department of Information Security,Beijing Electronic Science and Technology Institute,Beijing 100070,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2011-03-21 Published:2011-03-21

摘要: 首先分析了Leurent提出的MD-4原象攻击方法,该方法利用MD-4布尔函数的吸收性质,迭代函数的可逆性以及消息扩展方式的特殊性,首先形成伪原象攻击,之后利用基于树的方法将伪原象转变为原象攻击。采用随机图的方法,对其后一部分进行了改进,提高了攻击效率,将复杂度从2102降低到298。

关键词: Hash函数, 消息摘要算法第4版, 有向随机图, 原象攻击

Abstract: The preimage attack of MD-4 is discussed.Leurent’s method explores chiefly three properties of MD-4:The absorption properties of boolean function,reversibility of the iterative process and specificity of message expansion.After their pseudo preimage attack a tree-based method is followed to transform pseudo preimage to true preimage.Tree-based method is replaced with random graph method.The complexity of the attack reduces to 298 from 2102.

Key words: Hash function, Message Digest-4(MD-4) algorithm, directed random graph, preimage attack