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
摘要: 分析网络中用户名、密码的存储方式及其存在的风险。在此基础上分析MD5散列算法的弱点及其破译手段。针对这些破译方法提出基于MD5的迭代散列算法。该算法可以避免第二类生日攻击,并有效提高第一类生日攻击的复杂度,对于破解效率最高的彩虹表也具有免疫性,能够加强密码的安全性能,从而提高网络中信息传递和存储的安全性。
关键词:
MD5散列算法,
迭代算法,
生日攻击,
彩虹表
CLC Number:
ZHANG Jing. Iterative Hashing Algorithm Based on MD5[J]. Computer Engineering, 2011, 37(18): 124-126.
张青. 基于MD5的迭代散列算法[J]. 计算机工程, 2011, 37(18): 124-126.