How to Fill Up Merkle-Damgård Hash Functions
From MaRDI portal
Publication:3600380
DOI10.1007/978-3-540-89255-7_17zbMATH Open1206.94100OpenAlexW1607138385MaRDI QIDQ3600380FDOQ3600380
Authors: Kan Yasuda 
Publication date: 10 February 2009
Published in: Advances in Cryptology - ASIACRYPT 2008 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-89255-7_17
Recommendations
Cites Work
- Title not available (Why is that?)
- Formalizing human ignorance
- Title not available (Why is that?)
- Foundations of Cryptography
- Merkle-Damgård Revisited: How to Construct a Hash Function
- Title not available (Why is that?)
- Herding Hash Functions and the Nostradamus Attack
- Advances in Cryptology – CRYPTO 2004
- Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
- Second Preimage Attacks on Dithered Hash Functions
- Linear-XOR and Additive Checksums Don’t Protect Damgård-Merkle Hashes from Generic Attacks
- Strengthening Digital Signatures Via Randomized Hashing
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Failure-Friendly Design Principle for Hash Functions
- Finding Collisions in the Full SHA-1
- A composition theorem for universal one-way hash functions
- MD4 is Not One-Way
- Title not available (Why is that?)
- How to Break MD5 and Other Hash Functions
- Seven-Property-Preserving Iterated Hashing: ROX
- Fast Software Encryption
- Some observations on the theory of cryptographic hash functions
- Advances in Cryptology - EUROCRYPT 2004
- Title not available (Why is that?)
- Hash Functions in the Dedicated-Key Setting: Design Choices and MPP Transforms
- Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities
- Higher Order Universal One-Way Hash Functions
- New Techniques for Cryptanalysis of Hash Functions and Improved Attacks on Snefru
- A Three-Property-Secure Hash Function
- Getting the Best Out of Existing Hash Functions; or What if We Are Stuck with SHA?
Cited In (7)
- Salvaging Merkle-Damgård for Practical Applications
- Analysis of Property-Preservation Capabilities of the ROX and ESh Hash Domain Extenders
- Merkle-Damgård Revisited: How to Construct a Hash Function
- Characterizing Padding Rules of MD Hash Functions Preserving Collision Security
- Security analysis of randomize-hash-then-sign digital signatures
- Open problems in hash function security
- On Randomizing Hash Functions to Strengthen the Security of Digital Signatures
This page was built for publication: How to Fill Up Merkle-Damgård Hash Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3600380)
