Indifferentiability of double-block-length hash function without feed-forward operations
From MaRDI portal
Recommendations
- Optimally indifferentiable double-block-length hashing without post-processing and with support for longer key than single block
- On the indifferentiability of the Grøstl hash function
- A synthetic indifferentiability analysis of some block-cipher-based hash functions
- Some Plausible Constructions of Double-Block-Length Hash Functions
- A New Double-Block-Length Hash Function Using Feistel Structure
- Blockcipher-based double-length hash functions for pseudorandom oracles
- Towards Optimal Double-Length Hash Functions
- Indifferentiability characterization of hash functions and optimal bounds of popular domain extensions
- Cryptography and Coding
- Improved indifferentiability security bound for the prefix-free Merkle-Damgård hash function
Cited in
(3)
This page was built for publication: Indifferentiability of double-block-length hash function without feed-forward operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2014605)