Indifferentiability security of the fast wide pipe hash: breaking the birthday barrier
From MaRDI portal
Publication:293718
DOI10.1515/JMC-2014-0044zbMATH Open1408.94954OpenAlexW2341914780WikidataQ121045655 ScholiaQ121045655MaRDI QIDQ293718FDOQ293718
Authors: Dustin Moody, Souradyuti Paul, Daniel Smith-Tone 
Publication date: 9 June 2016
Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/jmc-2014-0044
Recommendations
- Speeding up the wide-pipe: secure and fast hashing
- Improved indifferentiability security bound for the JH mode
- Improved Indifferentiability Security Analysis of chopMD Hash Function
- Improved indifferentiability security bound for the prefix-free Merkle-Damgård hash function
- A Failure-Friendly Design Principle for Hash Functions
Cites Work
- Careful with composition: limitations of the indifferentiability framework
- Title not available (Why is that?)
- Merkle-Damgård Revisited: How to Construct a Hash Function
- On the Indifferentiability of the Sponge Construction
- Theory of Cryptography
- Improved indifferentiability security bound for the JH mode
- Some observations on indifferentiability
- Provable Security of BLAKE with Non-ideal Compression Function
- Multicollision Attacks on Some Generalized Sequential Hash Functions
- Security analysis of the mode of JH hash function
- On the indifferentiability of the Grøstl hash function
- Herding Hash Functions and the Nostradamus Attack
- Breaking the ICE – Finding Multicollisions in Iterated Concatenated and Expanded (ICE) Hash Functions
- Advances in Cryptology – CRYPTO 2004
- Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
- Second Preimage Attacks on Dithered Hash Functions
- Multi-Property-Preserving Hash Domain Extension and the EMD Transform
- A measure of dependence for cryptographic primitives relative to ideal functions
- On the Security of Hash Functions Employing Blockcipher Postprocessing
- Speeding up the wide-pipe: secure and fast hashing
- Improved Indifferentiability Security Analysis of chopMD Hash Function
- On the complexity of the herding attack and some related attacks on hash functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Simple Variant of the Merkle-Damgård Scheme with a Permutation
- A Failure-Friendly Design Principle for Hash Functions
- One Way Hash Functions and DES
- Techniques for cryptanalysis of block ciphers. (to appear)
Cited In (4)
This page was built for publication: Indifferentiability security of the fast wide pipe hash: breaking the birthday barrier
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293718)
