Indifferentiability of double length compression functions

DOI10.1007/978-3-642-45239-0_14zbMATH Open1317.94125OpenAlexW162617798MaRDI QIDQ2870097FDOQ2870097

Authors: Bart Mennink 

Publication date: 17 January 2014

Published in: Cryptography and Coding (Search for Journal in Brave)

Full work available at URL: https://www.cosic.esat.kuleuven.be/publications/article-2385.pdf

Recommendations

• Some Plausible Constructions of Double-Block-Length Hash Functions
• Cryptography and Coding
• Building indifferentiable compression functions from the PGV compression functions
• Optimal collision security in double block length hashing with single length key
• Another glance at double-length hashing

zbMATH Keywords

indifferentiabilitycompression functiondouble block lengthblock cipher based

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cited In (12)

• Improved Indifferentiability Security Analysis of chopMD Hash Function
• On the Weak Ideal Compression Functions
• Crooked indifferentiability of enveloped XOR revisited
• Block-cipher-based tree hashing
• Building indifferentiable compression functions from the PGV compression functions
• Cryptography and Coding
• Optimally indifferentiable double-block-length hashing without post-processing and with support for longer key than single block
• Some Plausible Constructions of Double-Block-Length Hash Functions
• Open problems in hash function security
• Indifferentiability of Permutation-Based Compression Functions and Tree-Based Modes of Operation, with Applications to MD6
• Optimal collision security in double block length hashing with single length key
• Security of truncated permutation without initial value

This page was built for publication: Indifferentiability of double length compression functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2870097)