How to Fill Up Merkle-Damgård Hash Functions

DOI10.1007/978-3-540-89255-7_17MaRDI QIDQ3600380zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

hash functionpaddingone-waynesssecond-preimage resistanceMerkle-Damgård

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Merkle-Damgård Revisited: How to Construct a Hash Function
• Characterizing Padding Rules of MD Hash Functions Preserving Collision Security
• Salvaging Merkle-Damgård for Practical Applications
• A Three-Property-Secure Hash Function
• scientific article; zbMATH DE number 1088254

Cites work

• scientific article; zbMATH DE number 1722677 (Why is no real title available?)
• scientific article; zbMATH DE number 4195165 (Why is no real title available?)
• scientific article; zbMATH DE number 1303133 (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?)
• A Failure-Friendly Design Principle for Hash Functions
• A Three-Property-Secure Hash Function
• A composition theorem for universal one-way hash functions
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities
• Fast Software Encryption
• Finding Collisions in the Full SHA-1
• 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
• Herding Hash Functions and the Nostradamus Attack
• Higher Order Universal One-Way Hash Functions
• How to Break MD5 and Other Hash Functions
• 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
• 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)

• 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)