Collision Resistant Double-Length Hashing

DOI10.1007/978-3-642-16280-0_7zbMath1286.94066MaRDI QIDQ4933214

Ewan Fleischmann, Stefan Lucks, Christian Forler, Michael Gorski

Publication date: 12 October 2010

Published in: Provable Security (Search for Journal in Brave)

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

zbMATH Keywords

ideal cipher model; proof of security; double block length; cryptographic hash function; double length; blockcipher based

Mathematics Subject Classification ID

94A60: Cryptography

Related Items

Collision Resistant Double-Length Hashing, The security of tandem-DM in the ideal cipher model, Blockcipher-Based Double-Length Hash Functions for Pseudorandom Oracles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast software encryption. 16th international workshop, FSE 2009, Leuven, Belgium, February 22--25, 2009. Revised selected papers
• Cryptography and coding. 12th IMA international conference, cryptography and coding 2009, Cirencester, UK, December 15--17, 2009. Proceedings
• Advances in cryptology - CRYPTO '89. Proceedings of a conference held at the University of California, Santa Barbara, CA (USA), August 20-24, 1989
• Blockcipher-Based Hashing Revisited
• On the Security of Tandem-DM
• How to Protect DES Against Exhaustive Key Search
• Some Plausible Constructions of Double-Block-Length Hash Functions
• Security of Cyclic Double Block Length Hash Functions
• Another Glance at Double-Length Hashing
• RIPEMD-160: A strengthened version of RIPEMD
• Collision Resistant Double-Length Hashing
• Cryptanalysis of the Hash Functions MD4 and RIPEMD
• The Collision Intractability of MDC-2 in the Ideal-Cipher Model
• Provably Secure Double-Block-Length Hash Functions in a Black-Box Model
• Finding Collisions in the Full SHA-1