How to Fill Up Merkle-Damgård Hash Functions
From MaRDI portal
Publication:3600380
Recommendations
Cites work
- A composition theorem for universal one-way hash functions
- A Failure-Friendly Design Principle for Hash Functions
- A Three-Property-Secure Hash Function
- Advances in Cryptology - EUROCRYPT 2004
- Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities
- Fast Software Encryption
- Finding Collisions in the Full SHA-1
- Finding collisions on a one-way street: Can secure hash functions be based on general assumptions?
- Formalizing human ignorance
- Foundations of Cryptography
- Getting the Best Out of Existing Hash Functions; or What if We Are Stuck with SHA?
- Hash Functions in the Dedicated-Key Setting: Design Choices and MPP Transforms
- Hash functions: from Merkle-Damgård to Shoup
- Herding Hash Functions and the Nostradamus Attack
- Higher order universal one-way hash functions
- How to Break MD5 and Other Hash Functions
- scientific article; zbMATH DE number 4195165 (Why is no real title available?)
- scientific article; zbMATH DE number 503258 (Why is no real title available?)
- scientific article; zbMATH DE number 503327 (Why is no real title available?)
- scientific article; zbMATH DE number 1006115 (Why is no real title available?)
- scientific article; zbMATH DE number 954401 (Why is no real title available?)
- Linear-XOR and Additive Checksums Don’t Protect Damgård-Merkle Hashes from Generic Attacks
- MD4 is Not One-Way
- Merkle-Damgård Revisited: How to Construct a Hash Function
- Multicollisions in iterated hash functions. Application to cascaded constructions
- New Techniques for Cryptanalysis of Hash Functions and Improved Attacks on Snefru
- 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
- Some observations on the theory of cryptographic hash functions
- Strengthening Digital Signatures Via Randomized Hashing
Cited in
(7)- Security analysis of randomize-hash-then-sign digital signatures
- On Randomizing Hash Functions to Strengthen the Security of Digital Signatures
- Salvaging Merkle-Damgård for Practical Applications
- Analysis of Property-Preservation Capabilities of the ROX and ESh Hash Domain Extenders
- Characterizing Padding Rules of MD Hash Functions Preserving Collision Security
- Merkle-Damgård Revisited: How to Construct a Hash Function
- Open problems in hash function security
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)