SHA-1充分条件自动化求解算法  

New Algorithm for Automatic Deriving Sufficient Conditions of SHA-1

作　　者：胡云山[1,2] 申意[1,2] 曾光[1,2] 韩文报[1,2] HU Yun-shan SHEN Yi ZENG Guang HAN Wen-bao(The PLA Information Engineering University, Zhengzhou 450001, China State Key Laboratory of Mathematical Engineering and Advanced Computing, Wuxi 214125, China)

机构地区：[1]解放军信息工程大学,郑州450001 [2]数学工程与先进计算国家重点实验室,无锡214125

出　　处：《计算机科学》2016年第8期123-127,147,共6页Computer Science

基　　金：国家自然科学基金项目(61003291);数学工程与先进计算国家重点实验室开放课题(2013A03;2013A10)资助

摘　　要：充分条件的求解是模差分攻击的重要步骤之一。将充分条件的求解转化为F_2上线性方程组的构造过程,利用线性方程组解的判定定理判断每步所求得充分条件的正确性,提出了针对SHA-1模差分攻击的充分条件自动化求解算法。文中算法做适当变形后,同样适用于MD5、SHA-0等与SHA-1结构相似的Hash函数充分条件的自动化求解。Deriving sufficient conditions is one of the important technologies in the differential mode attacking. In this paper, turning the problem of deriving sufficient conditions into structure of linear equations in F2, using the judgment theorem of linear equations to determine the correctness of the sufficient conditions derived by each step, a new algo- rithm for automatic deriving sufficient conditions of SHA-1 hash function was proposed. This algorithm is equally appli- cable to derive sufficient conditions in SHA-0 which has similar structure with SHA-1 after appropriate deformation.

关 键 词：密码学 HASH函数 SHA-1 充分条件 碰撞攻击 

分 类 号：TN918.1[电子电信—通信与信息系统]