On the Weak Ideal Compression Functions

DOI10.1007/978-3-642-02620-1_16zbMath1284.94096MaRDI QIDQ3634496

Keisuke Tanaka, Akira Numayama

Publication date: 25 June 2009

Published in: Information Security and Privacy (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02620-1_16

zbMATH Keywords

indifferentiability; random oracle; hash construction; weak ideal compression function

Mathematics Subject Classification ID

94A60: Cryptography

68P25: Data encryption (aspects in computer science)

Cites Work

• Unnamed Item
• Advances in cryptology -- EUROCRYPT 2005. 24th annual international conference on the theory and applications of cryptographic techniques, Aarhus, Denmark, May 22--26, 2005. Proceedings
• Advances in cryptology - CRYPTO '89. Proceedings of a conference held at the University of California, Santa Barbara, CA (USA), August 20-24, 1989
• Advances in cryptology -- CRYPTO 2005. 25th annual international cryptology conference, Santa Barbara, CA, USA, August 14--18, 2005. Proceedings
• On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are Weak
• Security of Encryption Schemes in Weakened Random Oracle Models
• Herding Hash Functions and the Nostradamus Attack
• Advances in Cryptology – CRYPTO 2004
• How to Break MD5 and Other Hash Functions
• Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
• Constructing an Ideal Hash Function from Weak Ideal Compression Functions
• Security of Digital Signature Schemes in Weakened Random Oracle Models
• Finding Collisions in the Full SHA-1
• Merkle-Damgård Revisited: How to Construct a Hash Function
• Theory of Cryptography