Improved indifferentiability security bound for the JH mode

DOI10.1007/S10623-015-0047-9MaRDI QIDQ285241zbMATH OpenOpenAlexFDO

Authors Dustin Moody, Souradyuti Paul, Daniel Smith-Tone

Publication date 19 May 2016

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-015-0047-9

zbMATH Keywords

securityindifferentiabilityhash functionsJH mode of operation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Cryptography (94A60)

Recommendations

• Security analysis of the mode of JH hash function
• Improved Indifferentiability Security Analysis of chopMD Hash Function
• Indifferentiability characterization of hash functions and optimal bounds of popular domain extensions
• On the indifferentiability of the Grøstl hash function
• Indifferentiability security of the fast wide pipe hash: breaking the birthday barrier

Cites work

• A measure of dependence for cryptographic primitives relative to ideal functions
• Advances in Cryptology – CRYPTO 2004
• Breaking the ICE – Finding Multicollisions in Iterated Concatenated and Expanded (ICE) Hash Functions
• Building indifferentiable compression functions from the PGV compression functions
• Careful with composition: limitations of the indifferentiability framework
• Collision Resistance of the JH Hash Function
• Herding Hash Functions and the Nostradamus Attack
• Linear-XOR and Additive Checksums Don’t Protect Damgård-Merkle Hashes from Generic Attacks
• Merkle-Damgård Revisited: How to Construct a Hash Function
• Multi-Property-Preserving Hash Domain Extension and the EMD Transform
• Multicollision Attacks on Some Generalized Sequential Hash Functions
• On Randomizing Hash Functions to Strengthen the Security of Digital Signatures
• On the indifferentiability of the Grøstl hash function
• Provable Security of BLAKE with Non-ideal Compression Function
• Second Preimage Attacks on Dithered Hash Functions
• Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
• Security analysis of randomize-hash-then-sign digital signatures
• Security analysis of the mode of JH hash function
• Security reductions of the second round SHA-3 candidates
• Some observations on indifferentiability
• Strengthening Digital Signatures Via Randomized Hashing
• Theory of Cryptography

Cited in

(10)

• Improved indifferentiability security proof for 3-round tweakable Luby-Rackoff
• Improved Indifferentiable Security Analysis of PHOTON
• Security analysis of the mode of JH hash function
• Crooked indifferentiability of enveloped XOR revisited
• Indifferentiability characterization of hash functions and optimal bounds of popular domain extensions
• Improved Indifferentiability Security Analysis of chopMD Hash Function
• A measure of dependence for cryptographic primitives relative to ideal functions
• Open problems in hash function security
• Indifferentiability security of the fast wide pipe hash: breaking the birthday barrier
• A novel permutation-based hash mode of operation \texttt{FP} and the hash function \texttt{SAMOSA}

This page was built for publication: Improved indifferentiability security bound for the JH mode

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q285241)