A Simple Variant of the Merkle-Damgård Scheme with a Permutation
From MaRDI portal
Publication:5387095
DOI10.1007/978-3-540-76900-2_7zbMath1153.94389OpenAlexW1587127684MaRDI QIDQ5387095
Aaram Yun, Je Hong Park, Shouichi Hirose
Publication date: 15 May 2008
Published in: Advances in Cryptology – ASIACRYPT 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-76900-2_7
Related Items (15)
Provable Chosen-Target-Forced-Midfix Preimage Resistance ⋮ Blockcipher-Based Double-Length Hash Functions for Pseudorandom Oracles ⋮ Indifferentiability security of the fast wide pipe hash: breaking the birthday barrier ⋮ \textsf{TEDT2} -- highly secure leakage-resilient TBC-based authenticated encryption ⋮ Towards Understanding the Known-Key Security of Block Ciphers ⋮ Double-block-length hash function for minimum memory size ⋮ A simple variant of the Merkle-Damgård scheme with a permutation ⋮ Optimal collision security in double block length hashing with single length key ⋮ Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric Cryptography ⋮ Pseudorandom-Function Property of the Step-Reduced Compression Functions of SHA-256 and SHA-512 ⋮ Building indifferentiable compression functions from the PGV compression functions ⋮ A Double-Piped Mode of Operation for MACs, PRFs and PROs: Security beyond the Birthday Barrier ⋮ Salvaging Merkle-Damgård for Practical Applications ⋮ A Scheme to Base a Hash Function on a Block Cipher ⋮ Collision-resistant and pseudorandom function based on Merkle-Damgård hash function
This page was built for publication: A Simple Variant of the Merkle-Damgård Scheme with a Permutation
