期刊文献+

SHA-512算法及其基于生日攻击的安全性分析 被引量:6

SHA-512 Algorithm and Its Security Analysis Based on Birthday Attack
下载PDF
导出
摘要 生日攻击是一种通用的碰撞攻击方法,它可用于攻击任何类型的散列函数。分析了SHA-512的算法原理,讨论了生日攻击的碰撞阈值和攻击步骤,并对SHA-512算法在生日攻击下的安全性进行了分析。通过分析得出SHA-512所有消息块处理完后得到了8个64位变量H0-H7的数据级联,并且输出散列码是512位,这对于攻击者来说是不可预测的,猜中的概率可以忽略,而找到目标消息的碰撞的计算复杂度为2256。所以,相对来说SHA-512的安全性比MD5,SHA-1等要高,采用SHA-512后将更能抵抗生日攻击,并能抵御已知密码分析攻击。 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.
出处 《后勤工程学院学报》 2010年第3期92-96,共5页 Journal of Logistical Engineering University
关键词 SHA-512 散列函数 生日攻击 安全性 SHA-512 hash function birthday attack security
  • 相关文献

参考文献6

  • 1STALLINGS W.Cryptography and network security:principles and practices[M].4th ed.Beijing:Publishing House of Electronics Indusutry,2006:334-358.
  • 2黄月江,祝世雄.信息安全与保密[M].北京:国防工业出版社,2008:141-170.
  • 3施峰,胡昌报,刘炳华.信息安全保密[M].北京:北京理工大学出版社,2007:239-258.
  • 4BELLARE M,KOHNO T.Hash function balance and its impact on birthday attacks[C]//EUROCRYPT 04.Berlin:Springer-Vedag,2004:401-418.
  • 5YUVAL G.How to swindle Rabin[M].California:Cryptoiogia,1979:273-285.
  • 6SHAI H.HUGO K.Stmagthening digital signatures via randomized hashing[C]//Cryptology-CRYPTO 2006.California:Springer-Vedag,2006:41-59.

共引文献7

同被引文献31

  • 1刘承彬,耿也,舒奎,高真,香子.有关中国剩余定理在多个素数的RSA解密运算中的加速公式的论证以及加速效率的估算[J].大连工业大学学报,2012,31(5):372-375. 被引量:3
  • 2杨波.现代密码学[M].北京:清华大学出版社,2007.
  • 3RIVEST R L, SHAMIR A, ADLEMAN L. A method for obtaining digital signatures and public key cryptosystems[ J]. Communications of the Association for Computer Machinery, 1978,21 (2) : 120 - 126.
  • 4CAO YINGYU, FU CHONG. An efficient Implementation of RSA digital signature algorithm[ C]// 2008 International Conference on Intelligent Computation Technology and Automation. Piscataway: IEEE Press, 2008:100 - 103.
  • 5WIENER M J. Cryptanalysis of short RSA secret exponents[ J]. IEEE Transactions on Information Theory, 1990, 36(3):553 -558.
  • 6BONEH D, DURFEE G. Cryptanalysis of RSA with private key d less than N^0.292[ j]. IEEE Information Theory Society, 2000, 46 (4) : 1339 - 1349.
  • 7PAIXAO C A M. An efficient variant of the RSA cryptosystem[ EB/ OL]. [2010 - 10 - 02]. http:// www. ime. usp. br/- capaixao/pa- per. pdf.
  • 8STALLINGS W. Cryprography and network security principles and practice[M].5th ed.北京:电子工业出版社,2011.
  • 9COUVEIGNES J M, EZOME T, LERCIER R. A faster pseudo-pri- reality test[ J]. Rendiconti del Circolo Matematico di Palermo, 2012, 61(2) : 261 -278.
  • 10肖丰霞,刘嘉勇,李国勇,闫廷光.基于电子钥匙的双向身份鉴别方案[J].信息与电子工程,2007,5(6):473-475. 被引量:2

引证文献6

二级引证文献13

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部