| SHA 1随机碰撞的充分条件构造 |
| |
| 引用本文： | 唐雨辰,韩文报. SHA 1随机碰撞的充分条件构造[J]. 信息工程大学学报, 2014, 15(5): 520-524 |
| |
| 作者姓名： | 唐雨辰 韩文报 |
| |
| 作者单位： | 信息工程大学,河南郑州,450001 |
| |
| 摘 要： | Hash函数SHA-1是重要的密码元件,寻找SHA-1的随机碰撞对已有理论上的突破,但SHA-1的碰撞实例还没有被发现。到目前为止,对SHA-1随机碰撞搜索的最好结果是McDonald给出的复杂度为52的差分路径。充分利用SHA-1第1轮轮函数IF的差分性质的优势,通过回溯验证的方法,给出基于该差分路径的全部充分条件,用于搜索SHA-1的随机碰撞实例。
|
| 关 键 词： | Hash函数 差分路径 SHA-1算法 |
Derivation of Sufficient Conditions for Searching Collisions in SHA 1 |
| |
| TANG Yu-chen,HAN Wen-bao. Derivation of Sufficient Conditions for Searching Collisions in SHA 1[J]. , 2014, 15(5): 520-524 |
| |
| Authors: | TANG Yu-chen HAN Wen-bao |
| |
| Affiliation: | ( Information Engineering University, Zhengzhou 450001, China) |
| |
| Abstract: | Hash function SHA-1 is an important cipher algorithm. Although SHA-1 has been theoretically broken,the task of finding a practical collision is yet to be completed. The most efficient differential path is the one first reported by McDonald,Hawkes and Pieprzyk,Differential Path for SHA-1 with complexity O（ 2^52）,Cryptology ePrint Archive,Report 2009/259,（2009）. Taking advantage of special differential properties of IF,all sufficient conditions of this differential path are given by backward test to find real collisions of the full SHA-1. |
| |
| Keywords: | Hash functions differential path SHA 1 |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《信息工程大学学报》浏览原始摘要信息 |
|
点击此处可从《信息工程大学学报》下载免费的PDF全文 |
|
