New second-preimage attacks on hash functions
From MaRDI portal
Recommendations
- Second Preimage Attacks on Dithered Hash Functions
- New second preimage attacks on dithered hash functions with low memory complexity
- Herding, second preimage and Trojan message attacks beyond Merkle-Damgård
- Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
- New Second Preimage Attack Variants against the MD-Structure
Cites work
- scientific article; zbMATH DE number 1583765 (Why is no real title available?)
- scientific article; zbMATH DE number 4195165 (Why is no real title available?)
- scientific article; zbMATH DE number 1088254 (Why is no real title available?)
- scientific article; zbMATH DE number 954401 (Why is no real title available?)
- scientific article; zbMATH DE number 3349081 (Why is no real title available?)
- scientific article; zbMATH DE number 3375509 (Why is no real title available?)
- A Failure-Friendly Design Principle for Hash Functions
- A composition theorem for universal one-way hash functions
- A cryptanalytic time-memory trade-off
- Abelian squares are avoidable on 4 letters
- Advances in Cryptology – CRYPTO 2004
- Collisions for 70-Step SHA-1: On the Full Cost of Collision Search
- Collisions of SHA-0 and Reduced SHA-1
- Complexité des facteurs des mots infinis engendrés par morphismes itérés
- Cryptanalysis of the Hash Functions MD4 and RIPEMD
- Efficient Collision Search Attacks on SHA-0
- Fast Software Encryption
- Finding Collisions in the Full SHA-1
- Finding Preimages in Full MD5 Faster Than Exhaustive Search
- Finding SHA-1 Characteristics: General Results and Applications
- Hash Functions and the (Amplified) Boomerang Attack
- Herding Hash Functions and the Nostradamus Attack
- How to Break MD5 and Other Hash Functions
- Improved Generic Algorithms for 3-Collisions
- Improved cryptanalysis of the reduced Grøstl compression function, ECHO permutation and AES block cipher
- MD4 is Not One-Way
- Merkle-Damgård Revisited: How to Construct a Hash Function
- Multi-Property-Preserving Hash Domain Extension and the EMD Transform
- On average sequence complexity
- On the complexity of infinite sequences
- Practical key-recovery attack against APOP, an MD5-based challenge-response authentication
- Preimages for Reduced SHA-0 and SHA-1
- Provable chosen-target-forced-midfix preimage resistance
- Rebound attack on the full Lane compression function
- Second Preimage Attacks on Dithered Hash Functions
- Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
- Seven-Property-Preserving Iterated Hashing: ROX
- Strengthening Digital Signatures Via Randomized Hashing
- Subword complexities of various classes of deterministic developmental languages without interactions
- The Rebound Attack: Cryptanalysis of Reduced Whirlpool and Grøstl
- Uniform tag sequences
Cited in
(13)- New second preimage attacks on dithered hash functions with low memory complexity
- Herding, second preimage and Trojan message attacks beyond Merkle-Damgård
- Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
- Herding Hash Functions and the Nostradamus Attack
- A second pre-image attack and a collision attack to cryptographic hash function lux
- Second Preimages for SMASH
- New Second Preimage Attack Variants against the MD-Structure
- Functional graph revisited: updates on (second) preimage attacks on hash combiners
- Quantum attacks on hash constructions with low quantum random access memory
- Generic attacks on hash combiners
- Second Preimage Attacks on Dithered Hash Functions
- The usage of counter revisited: second-preimage attack on new Russian standardized hash function
- Provable second preimage resistance revisited
This page was built for publication: New second-preimage attacks on hash functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q321303)
