Herding Hash Functions and the Nostradamus Attack

DOI10.1007/11761679_12zbMath1140.94354WikidataQ57006297 ScholiaQ57006297MaRDI QIDQ3593096

John Kelsey, Tadayoshi Kohno

Publication date: 24 September 2007

Published in: Advances in Cryptology - EUROCRYPT 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11761679_12

Mathematics Subject Classification ID

94A60: Cryptography

Related Items

Linear-XOR and Additive Checksums Don’t Protect Damgård-Merkle Hashes from Generic Attacks, Faster Multicollisions, Cryptanalysis of Grindahl, Does Secure Time-Stamping Imply Collision-Free Hash Functions?, How (Not) to Efficiently Dither Blockcipher-Based Hash Functions?, On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are Weak, Slide Attacks on a Class of Hash Functions, How to Fill Up Merkle-Damgård Hash Functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel collision search with cryptanalytic applications
• Advances in Cryptology – CRYPTO 2004
• Advances in Cryptology – CRYPTO 2004
• Cryptanalysis of the Hash Functions MD4 and RIPEMD
• How to Break MD5 and Other Hash Functions
• Collisions of SHA-0 and Reduced SHA-1
• Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
• Efficient Collision Search Attacks on SHA-0
• Finding Collisions in the Full SHA-1
• Merkle-Damgård Revisited: How to Construct a Hash Function
• Topics in Cryptology – CT-RSA 2005