Improved indifferentiability security bound for the prefix-free Merkle-Damgård hash function
From MaRDI portal
Publication:2331948
Recommendations
- Indifferentiable Security Analysis of Popular Hash Functions with Prefix-Free Padding
- Constructing Secure Hash Functions by Enhancing Merkle-Damgård Construction
- Improved Indifferentiability Security Analysis of chopMD Hash Function
- A new non-Merkle-Damgård structural hash function with provable security
- On the indifferentiability of the Grøstl hash function
- Indifferentiability characterization of hash functions and optimal bounds of popular domain extensions
- Domain extender for collision resistant hash functions: Improving upon Merkle-Damgård iteration
- On indifferentiable deterministic hashing into elliptic curves
- Indifferentiability security of the fast wide pipe hash: breaking the birthday barrier
- Indifferentiability of double-block-length hash function without feed-forward operations
Cited in
(7)- Indifferentiability of double-block-length hash function without feed-forward operations
- Indifferentiability security of the fast wide pipe hash: breaking the birthday barrier
- Security of practical cryptosystems using Merkle-Damgård hash function in the ideal cipher model
- Improved Indifferentiability Security Analysis of chopMD Hash Function
- Indifferentiability characterization of hash functions and optimal bounds of popular domain extensions
- Indifferentiable Security Analysis of Popular Hash Functions with Prefix-Free Padding
- Constructing Secure Hash Functions by Enhancing Merkle-Damgård Construction
This page was built for publication: Improved indifferentiability security bound for the prefix-free Merkle-Damgård hash function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2331948)