一个新的MD4消息差分  

New message difference for MD4

作　　者：李志敏[1] 徐馨[1] 李存华[1] 

机构地区：[1]淮海工学院计算机工程学院,江苏连云港222005

出　　处：《计算机工程与应用》2011年第32期94-97,111,共5页Computer Engineering and Applications

基　　金：江苏省自然科学基金(No.BK20082140);淮海工学院引进人才科研启动基金资助项目(No.KQ10121);淮海工学院校内课题(No.kx10530)

摘　　要：在对Hash函数MD4的已知碰撞攻击方法研究的基础上,提出了一个新的分析思路——在差分路径的第3轮中不再构造局部碰撞,并给出了一条全新的差分路径。结果表明:新的差分路径在第3轮中不存在充分条件需要满足,以此路径构造的MD4碰撞攻击效率与以往攻击结果相比最优,计算复杂度不超过1次MD4运算。The collision attack on MD4 is investigated, a new difference method that local collision does not exist in the third round of the differential path, is proposed.The results show that the new differential path has no sufficient condition in the third round to be satisfied.The efficiency of the collision attack which is using this differential path is superior to that of all known attacks.The complexity is less than 1 MD4 operation,which is smaller than the previous best work.

关 键 词：HASH函数 MD4 消息差分 差分路径 碰撞攻击 

分 类 号：TP309.7[自动化与计算机技术—计算机系统结构]