Indifferentiable Security Analysis of Popular Hash Functions with Prefix-Free Padding
From MaRDI portal
Recommendations
- A synthetic indifferentiability analysis of some block-cipher-based hash functions
- Improved indifferentiability security bound for the prefix-free Merkle-Damgård hash function
- Indifferentiability characterization of hash functions and optimal bounds of popular domain extensions
- Some observations on indifferentiability
- Building indifferentiable compression functions from the PGV compression functions
Cited in
(15)- A synthetic indifferentiability analysis of some block-cipher-based hash functions
- LWDSA: light-weight digital signature algorithm for wireless sensor networks
- Improved indifferentiability security bound for the prefix-free Merkle-Damgård hash function
- Blockcipher-based double-length hash functions for pseudorandom oracles
- On the indifferentiability of Fugue and Luffa
- Some observations on indifferentiability
- A Double-Piped Mode of Operation for MACs, PRFs and PROs: Security beyond the Birthday Barrier
- A Scheme to Base a Hash Function on a Block Cipher
- Indifferentiability characterization of hash functions and optimal bounds of popular domain extensions
- A simple variant of the Merkle-Damgård scheme with a permutation
- How to Build a Hash Function from Any Collision-Resistant Function
- Building indifferentiable compression functions from the PGV compression functions
- Block-cipher-based tree hashing
- Security of truncated permutation without initial value
- Open problems in hash function security
This page was built for publication: Indifferentiable Security Analysis of Popular Hash Functions with Prefix-Free Padding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5459085)
