New second-preimage attacks on hash functions
From MaRDI portal
Publication:321303
DOI10.1007/s00145-015-9206-4zbMath1365.94397OpenAlexW833451749WikidataQ57006271 ScholiaQ57006271MaRDI QIDQ321303
Pierre-Alain Fouque, John Kelsey, Orr Dunkelman, Charles Bouillaguet, Jonathan Hoch, Elena Andreeva, Sébastien Zimmer, Adi Shamir
Publication date: 13 October 2016
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-015-9206-4
Related Items (2)
Generic attacks on hash combiners ⋮ New second preimage attacks on dithered hash functions with low memory complexity
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On average sequence complexity
- Subword complexities of various classes of deterministic developmental languages without interactions
- On the complexity of infinite sequences
- Practical key-recovery attack against APOP, an MD5-based challenge-response authentication
- Provable Chosen-Target-Forced-Midfix Preimage Resistance
- Complexité des facteurs des mots infinis engendrés par morphismes itérés
- The Rebound Attack: Cryptanalysis of Reduced Whirlpool and Grøstl
- MD4 is Not One-Way
- Herding Hash Functions and the Nostradamus Attack
- Preimages for Reduced SHA-0 and SHA-1
- Hash Functions and the (Amplified) Boomerang Attack
- Finding Preimages in Full MD5 Faster Than Exhaustive Search
- Rebound Attack on the Full Lane Compression Function
- Improved Generic Algorithms for 3-Collisions
- Improved Cryptanalysis of the Reduced Grøstl Compression Function, ECHO Permutation and AES Block Cipher
- A cryptanalytic time-memory trade-off
- Abelian squares are avoidable on 4 letters
- 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
- Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
- Seven-Property-Preserving Iterated Hashing: ROX
- Efficient Collision Search Attacks on SHA-0
- Finding Collisions in the Full SHA-1
- Merkle-Damgård Revisited: How to Construct a Hash Function
- A Failure-Friendly Design Principle for Hash Functions
- Collisions for 70-Step SHA-1: On the Full Cost of Collision Search
- Second Preimage Attacks on Dithered Hash Functions
- Finding SHA-1 Characteristics: General Results and Applications
- Multi-Property-Preserving Hash Domain Extension and the EMD Transform
- Uniform tag sequences
- Fast Software Encryption
- Strengthening Digital Signatures Via Randomized Hashing
This page was built for publication: New second-preimage attacks on hash functions
