基于遗传策略的SHA-1差分路径搜索算法  

New Algorithm for Finding Differential Path of SHA-1 Based on Genetic Strategy

作　　者：胡云山[1,2] 申意[1,2] 曾光[1,2] 韩文报[1,2] 

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

出　　处：《信息工程大学学报》2016年第4期390-395,共6页Journal of Information Engineering University

基　　金：数学工程与先进计算国家重点实验室开放课题(2013A03;2013A10)

摘　　要：借鉴遗传算法的基本策略,以SHA-1第1轮后4步差分路径的汉明重作为遗传算法适应性函数的输入参数,以SHA-1差分进位扩展的位数作为遗传操作的基本单元,提出了一种新的SHA-1差分路径搜索算法。在相同消息差分条件下,该算法搜索得到的差分路径第1轮后4步汉明重为5,文献[1]给出的差分路径第1轮后4步汉明重为4。该算法同样适用于具有与SHA-1结构相似的MD5、SHA-0等Hash函数的差分路径搜索。Searching differential path is one of the key techniques in differential mode attacking. Based on the strategies of genetic algorithm, by choosing the hamming weight difference path of the last four steps in the first round as an input parameter to the fitness function, and selecting digits of carrying expansion as the basic unit operations of genetic algorithm, a new algorithm of searching differential path on the SHA-1 hash function is proposed. Under the same conditions of the different message, the hamming weight of the last four steps in the first round in this paper is 5, and the hamming weight of Wang Xiaoyun＇ s differential path is 4. This algorithm is equally applicable to finding differential path in MD5 or SHA-0 having similar structure with SHA-1.

关 键 词：密码学 HASH函数 SHA-1 差分路径 遗传算法 

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