When hashes collide

被引：5
|
作者：
Gutmann, P
Naccache, D
Palmer, CC
机构：
[1] Univ London Royal Holloway & Bedford New Coll, London NW1 4NS, England
[2] UCL, London, England
[3] Univ Auckland, Dept Comp Sci, Auckland 1, New Zealand
[4] IBM Corp, TJ Watson Res Ctr, Hawthorne, NY USA
来源：
IEEE SECURITY & PRIVACY | 2005年 / 3卷 / 03期
关键词：
D O I：
10.1109/MSP.2005.84
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Different issues raised due to problems associated with the SHA-1 hash function and its ancestor, MD5 are discussed. MD5 is known to have security problems and it need to be replaced as a hash function in security protocols. The SHA-1 algorithm is not quite strong and it takes 269 steps to find a collision instead of the expected 280 steps. An alternative to SHA-1 is RIPEMD-160, which improves the design by using two parallel data paths that must both be broken to compromise the overall hash function.
引用
收藏
页码：68 / 71
页数：4
相关论文
共 50 条
12345