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

DOI10.1007/s10623-010-9458-9zbMath1215.94061OpenAlexW2011875290MaRDI QIDQ2430693

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

hash functionsdisturbance vectorcollision attackSHA-1local collision independence

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Efficient implementation of SHA-3 hash function on 8-bit AVR-based sensor nodes, Classification of disturbance vectors for collision attack in SHA-1, Practical Free-Start Collision Attacks on 76-step SHA-1, A structure-based chaotic hashing scheme, Collisions of SHA-0 and Reduced SHA-1

Cites Work

• Unnamed Item
• Algebraic Cryptanalysis of 58-Round SHA-1
• Collisions on SHA-0 in One Hour
• Hash Functions and the (Amplified) Boomerang Attack
• The Impact of Carries on the Complexity of Collision Attacks on SHA-1
• Advances in Cryptology – CRYPTO 2004
• Collisions of SHA-0 and Reduced SHA-1
• On Authentication with HMAC and Non-random Properties
• Efficient Collision Search Attacks on SHA-0
• Finding Collisions in the Full SHA-1
• Collisions for 70-Step SHA-1: On the Full Cost of Collision Search
• Finding SHA-1 Characteristics: General Results and Applications
• Improved Collision Search for SHA-0
• Topics in Cryptology – CT-RSA 2005
• Cryptography and Coding
• Coding and Cryptography