Hash Functions and the (Amplified) Boomerang Attack

DOI10.1007/978-3-540-74143-5_14zbMath1215.94056OpenAlexW1550150171MaRDI QIDQ3612553

Thomas Peyrin, Antoine Joux

Publication date: 10 March 2009

Published in: Advances in Cryptology - CRYPTO 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74143-5_14

zbMATH Keywords

hash functionsboomerang attackSHA-1

Mathematics Subject Classification ID

Cryptography (94A60) Data structures (68P05)

Related Items

On the cost of ASIC hardware crackers: a SHA-1 case study ⋮ Boomerang Distinguishers on MD4-Family: First Practical Results on Full 5-Pass HAVAL ⋮ Boomerang Attacks on Hash Function Using Auxiliary Differentials ⋮ Classification of disturbance vectors for collision attack in SHA-1 ⋮ Boomerang Attack on Step-Reduced SHA-512 ⋮ Practical Free-Start Collision Attacks on 76-step SHA-1 ⋮ New second-preimage attacks on hash functions ⋮ Cryptanalysis of full \texttt{RIPEMD-128} ⋮ Enhancing differential-neural cryptanalysis ⋮ Classification and generation of disturbance vectors for collision attacks against SHA-1 ⋮ Collisions of SHA-0 and Reduced SHA-1 ⋮ Boomerang Attacks on BLAKE-32 ⋮ Cryptanalysis of SHA-0 and reduced SHA-1 ⋮ Collisions for 70-Step SHA-1: On the Full Cost of Collision Search ⋮ Rotational rebound attacks on reduced Skein ⋮ Boomerang Distinguisher for the SIMD-512 Compression Function