Finding Preimages in Full MD5 Faster Than Exhaustive Search
From MaRDI portal
Publication:3627432
DOI10.1007/978-3-642-01001-9_8zbMath1239.94064OpenAlexW1530387410MaRDI QIDQ3627432
Publication date: 12 May 2009
Published in: Advances in Cryptology - EUROCRYPT 2009 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-01001-9_8
Related Items (32)
Boomerang Distinguishers on MD4-Family: First Practical Results on Full 5-Pass HAVAL ⋮ Meet-in-the-middle attacks revisited: key-recovery, collision, and preimage attacks ⋮ \textsf{PIPO}: a lightweight block cipher with efficient higher-order masking software implementations ⋮ WARP: revisiting GFN for lightweight 128-bit block cipher ⋮ Extended meet-in-the-middle attacks on some Feistel constructions ⋮ All Subkeys Recovery Attack on Block Ciphers: Extending Meet-in-the-Middle Approach ⋮ Higher-Order Differential Meet-in-the-middle Preimage Attacks on SHA-1 and BLAKE ⋮ Collision attack on the full extended MD4 and pseudo-preimage attack on RIPEMD ⋮ New second-preimage attacks on hash functions ⋮ Cryptanalysis of Reduced-Round Whirlwind ⋮ Bicliques with Minimal Data and Time Complexity for AES ⋮ Security analysis of randomize-hash-then-sign digital signatures ⋮ Meet-in-the-middle attack with splice-and-cut technique and a general automatic framework ⋮ Improved attacks against reduced-round Whirlwind ⋮ Meet-in-the-middle preimage attacks on sponge-based hashing ⋮ Superposition meet-in-the-middle attacks: updates on fundamental security of AES-like hashing ⋮ Mind the \texttt{TWEAKEY} schedule: cryptanalysis on \texttt{SKINNYe-64-256} ⋮ A single-key attack on the full GOST block cipher ⋮ Multidimensional meet-in-the-middle attack and its applications to KATAN32/48/64 ⋮ An improved preimage attack against \texttt{HAVAL-3} ⋮ Collisions of MMO-MD5 and Their Impact on Original MD5 ⋮ A Single-Key Attack on the Full GOST Block Cipher ⋮ Meet-in-the-Middle Preimage Attacks on AES Hashing Modes and an Application to Whirlpool ⋮ Constructing quantum hash functions based on quantum walks on Johnson graphs ⋮ Simple hash function using discrete-time quantum walks ⋮ (Second) Preimage Attacks on Step-Reduced RIPEMD/RIPEMD-128 with a New Local-Collision Approach ⋮ MJH: A Faster Alternative to MDC-2 ⋮ Meet-in-the-Middle Attacks on Reduced-Round XTEA ⋮ A 3-Subset Meet-in-the-Middle Attack: Cryptanalysis of the Lightweight Block Cipher KTANTAN ⋮ Meet-in-the-Middle Preimage Attacks on Double-Branch Hash Functions: Application to RIPEMD and Others ⋮ Automatic search of meet-in-the-middle preimage attacks on AES-like hashing ⋮ Meet-in-the-Middle Attacks Using Output Truncation in 3-Pass HAVAL
Cites Work
- Preimage Attacks on Step-Reduced MD5
- MD4 is Not One-Way
- Preimages for Reduced SHA-0 and SHA-1
- Preimage Attacks on 3, 4, and 5-Pass HAVAL
- Inversion Attacks on Secure Hash Functions Using sat Solvers
- Preimage Attacks on One-Block MD4, 63-Step MD5 and More
- How to Break MD5 and Other Hash Functions
- Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
- Unnamed Item
- Unnamed Item
This page was built for publication: Finding Preimages in Full MD5 Faster Than Exhaustive Search
