作者: Christophe De Cannière , Christian Rechberger
DOI: 10.1007/11935230_1
关键词: Search tree 、 Search algorithm 、 Block cipher 、 Computer science 、 Cryptography 、 Algorithm 、 Collision 、 Proof of concept 、 Hash function 、 SHA-1
摘要: The most efficient collision attacks on members of the SHA family presented so far all use complex characteristics which were manually constructed by Wang et al. In this report, we describe a method to search for in an automatic way. This is particularly useful multi-block attacks, and as proof concept, give two-block 64-step SHA-1 based new characteristic. highest number steps was published 58. We also unified view expected work factor needed degrees freedom search, facilitates optimization.