Finding SHA-1 Characteristics: General Results and Applications

DOI10.1007/11935230_1zbMath1172.94572OpenAlexW124034723MaRDI QIDQ5459066

Christophe De Cannière, Christian Rechberger

Publication date: 24 April 2008

Published in: Advances in Cryptology – ASIACRYPT 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11935230_1

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (36)

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 ⋮ Collision attack on the full extended MD4 and pseudo-preimage attack on RIPEMD ⋮ New second-preimage attacks on hash functions ⋮ Cryptanalysis of full \texttt{RIPEMD-128} ⋮ Improved (semi-free-start/near-) collision and distinguishing attacks on round-reduced RIPEMD-160 ⋮ Improved Top-Down Techniques in Differential Cryptanalysis ⋮ Cryptanalysis of Grindahl ⋮ Analysis of RIPEMD-160: new collision attacks and finding characteristics with MILP ⋮ Enhancing differential-neural cryptanalysis ⋮ Collisions for Round-Reduced LAKE ⋮ Differential cryptanalysis in the fixed-key model ⋮ Classification and generation of disturbance vectors for collision attacks against SHA-1 ⋮ The Hash Function Family LAKE ⋮ A (Second) Preimage Attack on the GOST Hash Function ⋮ Internal differential collision attacks on the reduced-round Grøstl-0 hash function ⋮ Collisions for RC4-Hash ⋮ Multi-collision Attack on the Compression Functions of MD4 and 3-Pass HAVAL ⋮ Colliding Message Pair for 53-Step HAS-160 ⋮ Weaknesses in the HAS-V Compression Function ⋮ MILP-Based Automatic Search Algorithms for Differential and Linear Trails for Speck ⋮ Linear Analysis of Reduced-Round CubeHash ⋮ Collisions of MMO-MD5 and Their Impact on Original MD5 ⋮ Cryptanalysis of SHA-0 and reduced SHA-1 ⋮ Cryptanalysis of the GOST Hash Function ⋮ Analysis of Boomerang Differential Trails via a SAT-Based Constraint Solver URSA ⋮ Collisions for 70-Step SHA-1: On the Full Cost of Collision Search ⋮ Forgery Attacks on Round-Reduced ICEPOLE-128 ⋮ Speeding up Collision Search for Byte-Oriented Hash Functions ⋮ The Differential Analysis of S-Functions ⋮ Optimal Covering Codes for Finding Near-Collisions ⋮ Deterministic Differential Properties of the Compression Function of BMW ⋮ Efficient Hash Collision Search Strategies on Special-Purpose Hardware ⋮ Automatic verification of differential characteristics: application to reduced Gimli ⋮ The rebound attack and subspace distinguishers: application to Whirlpool

This page was built for publication: Finding SHA-1 Characteristics: General Results and Applications