| MD5散列算法的研究 |
| |
| 引用本文： | 姜学军 曹 烨. MD5散列算法的研究[J]. 沈阳理工大学学报, 2014, 0(2): 52-55 |
| |
| 作者姓名： | 姜学军 曹 烨 |
| |
| 作者单位： | 沈阳理工大学信息科学与工程学院,辽宁沈阳110159 |
| |
| 摘 要： | 借鉴了M.M.J.Stevens的碰撞思路,重新编写了MD5碰撞算法中的核心循环,主要提供一对MD5碰撞产生的过程以及碰撞的完成。通过实验统计分析,利用改进的MD5碰撞算法找到一对碰撞信息所用平均时间不多于60s,且该算法较之传统的MD5碰撞算法具有更好的可读性和可移植性。
|
| 关 键 词： | MD5算法 碰撞 散列算法 消息摘要 差分路径 |
Research of the Hash Algorithm Based on MD5 |
| |
| JIANG Xuejun,CAO Ye. Research of the Hash Algorithm Based on MD5[J]. Transactions of Shenyang Ligong University, 2014, 0(2): 52-55 |
| |
| Authors: | JIANG Xuejun CAO Ye |
| |
| Affiliation: | ( Shenyang Ligong University, Shenyang 110159, China) |
| |
| Abstract: | This paper draws on the ideas of M. M. J. Stevens and rewrites the core loop in MD5 collision algorithm. This algorithm mainly provides a pair of MD5 collision process and the completion of the collision. Through statistical analysis of experiments, the improved MD5 collision algorithm finds a pair＇s average time not more than 60s, and compared with the traditional algorithm, this algorithm has better readability and portability. |
| |
| Keywords: | MD5 algorithm collision hash algorithm message digest differential path |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
