-
185浏览
-
0点赞
-
0收藏
-
0分享
-
146下载
-
0评论
-
引用
期刊论文
Finding Collisions in the Full SHA-1
Crypto 2005, LNCS 3621, pp. 17-36, 2005.,-0001,():
In this paper, we present new collision search attacks on the hash function SHA-1. We show that collisions of SHA-1 can be found with complexity less than 269 hash operations. This is the first attack on the full 80-step SHA-1 with complexity less than the 280 theoretical bound.
【免责声明】以下全部内容由[王小云]上传于[2006年09月21日 02时48分05秒],版权归原创者所有。本文仅代表作者本人观点,与本网站无关。本网站对文中陈述、观点判断保持中立,不对所包含内容的准确性、可靠性或完整性提供任何明示或暗示的保证。请读者仅作参考,并请自行承担全部责任。
本学者其他成果
同领域成果