Classification and generation of disturbance vectors for collision attacks against SHA-1

DOI10.1007/S10623-010-9458-9MaRDI QIDQ2430693zbMATH OpenOpenAlexFDO

Authors Stéphane Manuel

Publication date 8 April 2011

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-010-9458-9

zbMATH Keywords

collision attackdisturbance vectorhash functionslocal collision independenceSHA-1

Mathematics Subject Classification ID

Cryptography (94A60)

Review text

The main contribution is a classification (type-I/type-II) of all published disturbance vectors used in differential collision attacks against SHA-1. A deterministic algorithm is presented which produces efficient disturbance vectors with respect to any given cost function. Two simple cost functions are defined to evaluate the efficiency of a candidate disturbance vector. Using this algorithm and these cost functions, all previously known vectors are retrieved and it is found that the most efficient disturbance vector is the one first reported as Codeword2 by Jutla and Patthak. Moreover, a statistical evaluation of local collision's holding probabilities is presented and it is shown that the common assumption of local collision independence is flawed.

Recommendations

• Coding and Cryptography
• Analysis of SHA-1 with reducing width for modular differential attack
• Cryptanalysis of SHA-0 and reduced SHA-1
• Finding SHA-1 Characteristics: General Results and Applications
• Cryptography and Coding

Cites work

• Advances in Cryptology – CRYPTO 2004
• Algebraic Cryptanalysis of 58-Round SHA-1
• Coding and Cryptography
• Collisions for 70-Step SHA-1: On the Full Cost of Collision Search
• Collisions of SHA-0 and Reduced SHA-1
• Collisions on SHA-0 in One Hour
• Cryptography and Coding
• Efficient Collision Search Attacks on SHA-0
• Finding Collisions in the Full SHA-1
• Finding SHA-1 Characteristics: General Results and Applications
• Hash Functions and the (Amplified) Boomerang Attack
• scientific article; zbMATH DE number 1302838 (Why is no real title available?)
• Improved Collision Search for SHA-0
• On Authentication with HMAC and Non-random Properties
• The Impact of Carries on the Complexity of Collision Attacks on SHA-1
• Topics in Cryptology – CT-RSA 2005

Cited in

(8)

• Analysis of SHA-1 with reducing width for modular differential attack
• A structure-based chaotic hashing scheme
• Practical free-start collision attacks on 76-step SHA-1
• Classification of disturbance vectors for collision attack in SHA-1
• Collisions of SHA-0 and Reduced SHA-1
• Cryptography and Coding
• Coding and Cryptography
• Efficient implementation of SHA-3 hash function on 8-bit AVR-based sensor nodes

This page was built for publication: Classification and generation of disturbance vectors for collision attacks against SHA-1

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2430693)