Characterizing Padding Rules of MD Hash Functions Preserving Collision Security
From MaRDI portal
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
- scientific article; zbMATH DE number 1583788 (Why is no real title available?)
- scientific article; zbMATH DE number 4195165 (Why is no real title available?)
- scientific article; zbMATH DE number 4057439 (Why is no real title available?)
- scientific article; zbMATH DE number 1088254 (Why is no real title available?)
- A Three-Property-Secure Hash Function
- Cryptography. Theory and practice
- Domain extender for collision resistant hash functions: Improving upon Merkle-Damgård iteration
- Fast Software Encryption
- 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)
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)