Speeding up Collision Search for Byte-Oriented Hash Functions
From MaRDI portal
Publication:3623043
DOI10.1007/978-3-642-00862-7_11zbMath1237.94068OpenAlexW1871494460MaRDI QIDQ3623043
Dmitry Khovratovich, Ivica Nikolić, Alex Biryukov
Publication date: 29 April 2009
Published in: Topics in Cryptology – CT-RSA 2009 (Search for Journal in Brave)
Full work available at URL: http://orbilu.uni.lu/handle/10993/17081
Related Items (6)
Triangulating rebound attack on AES-like hashing ⋮ Automatic Search for Key-Bridging Technique: Applications to LBlock and TWINE ⋮ Improved practical attacks on round-reduced Keccak ⋮ Attacks on Hash Functions Based on Generalized Feistel: Application to Reduced-Round Lesamnta and SHAvite-3 512 ⋮ Automatic Search of Meet-in-the-Middle and Impossible Differential Attacks ⋮ Quantum cryptanalysis of the full AES-256-based Davies-Meyer, Hirose and MJH hash functions
Cites Work
- Unnamed Item
- Unnamed Item
- Cryptanalysis of Grindahl
- Cryptanalysis of FORK-256
- The Grindahl Hash Functions
- Collisions on SHA-0 in One Hour
- The Hash Function Family LAKE
- Cryptanalysis of LASH
- The Wide Trail Design Strategy
- How to Break MD5 and Other Hash Functions
- Finding Collisions in the Full SHA-1
- Finding SHA-1 Characteristics: General Results and Applications
This page was built for publication: Speeding up Collision Search for Byte-Oriented Hash Functions
