New strategy for searching disturbance vector of SHA-1 collision attack

Dear editor,We present a new algorithm to search for effective disturbance vectors with a complexity of 2~（38）based on the following two properties of disturbance vectors.One property is the weight correlation between the first 16-step disturbance vectors and the60-step disturbance vectors.The other...

Full description

Saved in:
Bibliographic Details
Published in:Science China. Information sciences 2017-12, Vol.60 (12), p.276-278, Article 129101
Main Authors: Feng, Hao, Zeng, Guang, Han, Wenbao, Yang, Yang
Format: Article
Language:English
Subjects:
Computer Science
Information Systems and Communication Service
Letter
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:Dear editor,We present a new algorithm to search for effective disturbance vectors with a complexity of 2~（38）based on the following two properties of disturbance vectors.One property is the weight correlation between the first 16-step disturbance vectors and the60-step disturbance vectors.The other property requires all the differences of the active bit positions of the first 16-step disturbance vectors to be
ISSN:1674-733X
1869-1919
DOI:10.1007/s11432-016-9241-x