首页 | 本学科首页   官方微博 | 高级检索  
   检索      

SHA-512算法及其基于生日攻击的安全性分析
引用本文:刘美,王玉柱,何定养,郑贤路.SHA-512算法及其基于生日攻击的安全性分析[J].后勤工程学院学报,2010,26(3):92-96.
作者姓名:刘美  王玉柱  何定养  郑贤路
作者单位:后勤工程学院,后勤信息工程系,重庆,401311
摘    要:生日攻击是一种通用的碰撞攻击方法,它可用于攻击任何类型的散列函数。分析了SHA-512的算法原理,讨论了生日攻击的碰撞阈值和攻击步骤,并对SHA-512算法在生日攻击下的安全性进行了分析。通过分析得出SHA-512所有消息块处理完后得到了8个64位变量H0-H7的数据级联,并且输出散列码是512位,这对于攻击者来说是不可预测的,猜中的概率可以忽略,而找到目标消息的碰撞的计算复杂度为2256。所以,相对来说SHA-512的安全性比MD5,SHA-1等要高,采用SHA-512后将更能抵抗生日攻击,并能抵御已知密码分析攻击。

关 键 词:SHA-512  散列函数  生日攻击  安全性

SHA-512 Algorithm and Its Security Analysis Based on Birthday Attack
LIU Mei,WANG Yu-zhu,HE Ding-yang,ZHENG Xian-lu.SHA-512 Algorithm and Its Security Analysis Based on Birthday Attack[J].Journal of Logistical Engineering University,2010,26(3):92-96.
Authors:LIU Mei  WANG Yu-zhu  HE Ding-yang  ZHENG Xian-lu
Institution:(Dept.of Logistical Information Engineering,LEU,Chongqing 401311,China)
Abstract:Birthday attack is a kind of common collision attack method,it can be used to attack any type of hash function.This paper first analyzes the principle of the algorithm of SHA-512,then discusses the collision threshold of the birthday attack as well as its attack steps,and at last makes an security analysis of SHA-512 algorithm under Birthday attack.By analyzing and after all the message blocks of SHA-512 algorithm have been dealt with,eight 64 bit variable data can be get from H0-H7 cascade can be got of which the output of the hash code is 512 bit,Therefore,it is unpredictable for the attacker,whose guessed probability can be ignored,while the computational complexity of finding the target message collision is 2256.So,relatively speaking,the security of SHA-512 is higher than MD5,SHA-1,and so on,it is more resistant to birthday attacks,and can resist known cryptanalytic attacks.
Keywords:SHA-512
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号