Classification of disturbance vectors for collision attack in SHA-1

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 vectors.First, we improve the EEM disturbance vectors search algorithm by Manuel. We increase the...

Full description

Saved in:
Bibliographic Details
Published in:Science China. Information sciences 2015-11, Vol.58 (11), p.99-108
Main Authors: Tang, YuChen, Zeng, Guang, Han, WenBao
Format: Article
Language:English
Subjects:
Computer Science
Information Systems and Communication Service
Minimum weight
Research Paper
Search algorithms
SHA-1
信息窗口
分类
向量
扰动
搜索算法
时间复杂度
碰撞攻击
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 vectors.First, we improve the EEM disturbance vectors search algorithm by Manuel. We increase the Hamming weight of information window from 4 to 6, with 2^44 time complexity, which is 2^8 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.
ISSN:1674-733X
1869-1919
DOI:10.1007/s11432-015-5280-3