计算机工程 ›› 2011, Vol. 37 ›› Issue (18): 124-126.doi: 10.3969/j.issn.1000-3428.2011.18.041

• 安全技术 • 上一篇    下一篇

基于MD5的迭代散列算法

张 青   

  1. (中国矿业大学计算机科学与技术学院,江苏 徐州 221008)
  • 收稿日期:2011-02-10 出版日期:2011-09-20 发布日期:2011-09-20
  • 作者简介:张 青(1989-),男,本科生,主研方向:信息安全
  • 基金项目:
    江苏省自然科学基金资助项目(BK2007035);中国矿业大学青年科技基金资助项目(0D061035, 2007A047)

Iterative Hashing Algorithm Based on MD5

ZHANG Qing   

  1. (School of Computer Science and Technology, China University of Mining and Technology, Xuzhou 221008, China)
  • Received:2011-02-10 Online:2011-09-20 Published:2011-09-20

摘要: 分析网络中用户名、密码的存储方式及其存在的风险。在此基础上分析MD5散列算法的弱点及其破译手段。针对这些破译方法提出基于MD5的迭代散列算法。该算法可以避免第二类生日攻击,并有效提高第一类生日攻击的复杂度,对于破解效率最高的彩虹表也具有免疫性,能够加强密码的安全性能,从而提高网络中信息传递和存储的安全性。

关键词: MD5散列算法, 迭代算法, 生日攻击, 彩虹表

Abstract: The paper analyzes the user name and password storage methods and their risks on the internet. On this basis, it analyzes MD5 message digest encryption weaknesses and deciphering means. In response to these decoding methods, it proposes an iterative algorithm based on MD5. This algorithm is immune to the second birthday attack, meanwhile improve the complicates of the the first birthday attack. It is also useful for rainbow table attack. The algorithm can enhance password security features, thereby enhancing the network information transmission and storage security.

Key words: MD5 hashing algorithm, iterative algorithm, birthday attack, rainbow table

中图分类号: