Classification of disturbance vectors for collision attack in SHA-1

作     者：TANG YuChen ZENG Guang HAN WenBao 

作者机构：The Information Engineering University 

出 版 物：《Science China(Information Sciences)》 (中国科学:信息科学(英文版))

年 卷 期：2015年第58卷第11期

页      面：103-112页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

基　　金：supported by Open Project Program of the State Key Laboratory of Mathematical Engineering and Advanced Computing(Grant Nos.2013A03 2013A10) 

主　　题：Hash function SHA-1 collision attack disturbance vector extended expanded message 

摘      要：A good disturbance vector is one of the key techniques to find SHA-1 collisions and to construct valid differential paths. The main work of this paper is to classify the types of the optimal disturbance ***, we improve the EEM disturbance vectors search algorithm by Manuel. We increase the Hamming weight of information window from 4 to 6, with 244 time complexity, which is 28 times better than that of Manuel’s work. Based on this result, we prove that there are only two types of the optimal disturbance vectors, type-I and type-II, which have minimum weight of 25 in the last 60 of the 80 expanded words, in the total 2512 disturbance vectors searching space.