Characterizing Padding Rules of MD Hash Functions Preserving Collision Security

DOI10.1007/978-3-642-02620-1_12zbMath1307.94079OpenAlexW1604638414MaRDI QIDQ3634492

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

suffix-freepadding rulecollision resistantMD hash function

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Domain extender for collision resistant hash functions: Improving upon Merkle-Damgård iteration
• Some observations on the theory of cryptographic hash functions
• A Three-Property-Secure Hash Function
• Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
• Fast Software Encryption
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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