Improved Indifferentiability Security Analysis of chopMD Hash Function

DOI10.1007/978-3-540-71039-4_27zbMath1154.68385OpenAlexW2137923131MaRDI QIDQ3525693

Mridul Nandi, Donghoon Chang

Publication date: 18 September 2008

Published in: Fast Software Encryption (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-71039-4_27

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Theory of software (68N99)

Related Items (12)

Indifferentiability security of the fast wide pipe hash: breaking the birthday barrier ⋮ From Indifferentiability to Constructive Cryptography (and Back) ⋮ Block-cipher-based tree hashing ⋮ Crooked indifferentiability of enveloped XOR revisited ⋮ A simple variant of the Merkle-Damgård scheme with a permutation ⋮ Improved indifferentiability security proof for 3-round tweakable Luby-Rackoff ⋮ On the Indifferentiability of Fugue and Luffa ⋮ Practical Near-Collisions on the Compression Function of BMW ⋮ Quantum algorithm for the multicollision problem ⋮ A Double-Piped Mode of Operation for MACs, PRFs and PROs: Security beyond the Birthday Barrier ⋮ Meet-in-the-Middle Attacks Using Output Truncation in 3-Pass HAVAL ⋮ Beyond conventional security in sponge-based authenticated encryption modes

This page was built for publication: Improved Indifferentiability Security Analysis of chopMD Hash Function