Collisions for 70-Step SHA-1: On the Full Cost of Collision Search

DOI10.1007/978-3-540-77360-3_4zbMath1154.94387OpenAlexW1865207131MaRDI QIDQ5452246

Florian Mendel, Christophe De Cannière, Christian Rechberger

Publication date: 25 March 2008

Published in: Selected Areas in Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77360-3_4

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (11)

Practical Free-Start Collision Attacks on 76-step SHA-1 ⋮ Collision attack on the full extended MD4 and pseudo-preimage attack on RIPEMD ⋮ New second-preimage attacks on hash functions ⋮ A structure-based chaotic hashing scheme ⋮ Collisions for Round-Reduced LAKE ⋮ Classification and generation of disturbance vectors for collision attacks against SHA-1 ⋮ Cryptanalysis of SHA-0 and reduced SHA-1 ⋮ Cryptanalysis of the GOST Hash Function ⋮ Optimal Covering Codes for Finding Near-Collisions ⋮ Efficient Hash Collision Search Strategies on Special-Purpose Hardware ⋮ The rebound attack and subspace distinguishers: application to Whirlpool

Cites Work

• Unnamed Item
• The full cost of cryptanalytic attacks
• Algebraic Cryptanalysis of 58-Round SHA-1
• 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
• Cryptanalysis of the Hash Functions MD4 and RIPEMD
• How to Break MD5 and Other Hash Functions
• Collisions of SHA-0 and Reduced SHA-1
• Efficient Collision Search Attacks on SHA-0
• Finding Collisions in the Full SHA-1
• Finding SHA-1 Characteristics: General Results and Applications
• Improved Collision Search for SHA-0
• Topics in Cryptology – CT-RSA 2005
• Cryptography and Coding

This page was built for publication: Collisions for 70-Step SHA-1: On the Full Cost of Collision Search