引用本文:陈士伟,金晨辉.MD5碰撞攻击中的充要条件集.软件学报,2009,20(6):1617-1624
【打印本页】   【下载PDF全文】   查看/发表评论  【EndNote】   【RefMan】   【BibTex】
←前一篇|后一篇→ 过刊浏览    高级检索
本文已被:浏览 5998次   下载 8230 本文二维码信息
码上扫一扫!
分享到: 微信 更多
MD5碰撞攻击中的充要条件集
陈士伟1, 金晨辉1
信息工程大学 电子技术学院,河南 郑州 450004
摘要:
通过分析MD5中非线性函数的性质以及模232减差分和异或差分的性质,证明了Liang Jie和Lai Xuejia 给出的产生MD5碰撞的充分条件集中的条件是保证第23~62步的差分路径满足的充要条件,给出了保证第63、64步的输出差分满足的充要条件集.利用得到的充要条件集,提出了对MD5的改进的碰撞攻击算法,该算法的平均计算复杂度约为已有碰撞攻击算法的0.718 7倍,并通过实验对该算法的改进效果进行了验证.
关键词:  MD5  充要条件集  碰撞攻击  差分路径
DOI:
分类号:
基金项目:Supported by the Science Fund for Distinguished Young Scholars of He’nan Province of China under Grant No.0312001800 (河南省杰出青年科学基金)
Set of Necessary and Sufficient Conditions in Collision Attacks on MD5
CHEN Shi-Wei,JIN Chen-Hui
Abstract:
By analyzing the properties of the nonlinear functions used in MD5 and the differences in terms of XOR and subtraction modulo 232, this paper proves that some sufficient conditions presented by Liang Jie and Lai Xuejia are also necessary to guarantee the differential path from the 23rd step to the 62nd step and give a set of necessary and sufficient conditions to guarantee the output differences of the last two steps. Then, according to the set of necessary and sufficient conditions this paper presents an improved collision attack algorithm on MD5. Finally, it analyzes the average computational complexity of the attack algorithm which is 0.718 7 times of that of the previous collision attack algorithms and proves the efficiency of the improved algorithm by computer simulations.
Key words:  MD5  a set of necessary and sufficient conditions  collision attack  differential path

引用本文:
【打印本页】   【下载PDF全文】   查看/发表评论  【EndNote】   【RefMan】   【BibTex】
←前一篇|后一篇→ 过刊浏览    高级检索
本文已被:浏览次   下载  
分享到: 微信 更多
摘要:
关键词:  
DOI:
分类号:
基金项目:
Abstract:
Key words: