Characterizing Padding Rules of MD Hash Functions Preserving Collision Security

DOI10.1007/978-3-642-02620-1_12MaRDI QIDQ3634492zbMATH OpenOpenAlexFDO

Authors Mridul Nandi

Publication date 25 June 2009

Published in Information Security and Privacy (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02620-1_12

zbMATH Keywords

collision resistantMD hash functionpadding rulesuffix-free

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• How to Fill Up Merkle-Damgård Hash Functions
• A Three-Property-Secure Hash Function
• Domain extender for collision resistant hash functions: Improving upon Merkle-Damgård iteration
• Merkle-Damgård Revisited: How to Construct a Hash Function
• Constructing Secure Hash Functions by Enhancing Merkle-Damgård Construction

Cites work

• A Three-Property-Secure Hash Function
• Collision-resistant hashing: Towards making UOWHFs practical
• Cryptography. Theory and practice
• Domain extender for collision resistant hash functions: Improving upon Merkle-Damgård iteration
• Encode-then-encipher encryption: How to exploit nonces or redundancy in plaintexts for efficient cryptography
• Fast Software Encryption
• scientific article; zbMATH DE number 4195165 (Why is no real title available?)
• scientific article; zbMATH DE number 4057439 (Why is no real title available?)
• Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
• Some observations on the theory of cryptographic hash functions
• Using hash functions as a hedge against chosen ciphertext attack

Cited in

(2)

• MD2 is not secure without the checksum byte
• How to Fill Up Merkle-Damgård Hash Functions

This page was built for publication: Characterizing Padding Rules of MD Hash Functions Preserving Collision Security

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3634492)