The Preimage Security of Double-Block-Length Compression Functions

DOI10.1007/978-3-642-25385-0_13zbMath1227.94026OpenAlexW2177399963MaRDI QIDQ3102189

Ewan Fleischmann, Jooyoung Lee, Matthias Krause, Frederik Armknecht, Martijn Stam, John P. Steinberger

Publication date: 2 December 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25385-0_13

zbMATH Keywords

FoundationsBlock CipherBeyond Birthday BoundHash FunctionPreimage Resistance

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (6)

The security of tandem-DM in the ideal cipher model ⋮ Open problems in hash function security ⋮ Efficient leakage-resilient MACs without idealized assumptions ⋮ Double-block-length hash function for minimum memory size ⋮ Optimal collision security in double block length hashing with single length key ⋮ On the collision and preimage security of MDC-4 in the ideal cipher model

This page was built for publication: The Preimage Security of Double-Block-Length Compression Functions