NIST logo

Publication Citation: Improved Indifferentiability Security Bound for the JH Mode

NIST Authors in Bold

Author(s): Dustin Moody; Souradyuti Paul; Daniel Smith;
Title: Improved Indifferentiability Security Bound for the JH Mode
Published: March 22, 2012
Abstract: The JH hash function is one of the five fi nalists of the ongoing NIST SHA3 hash function competition. Despite several earlier attempts, and years of analysis, the indi fferentiability security bound of the JH mode has so far remained remarkably low, only up to n/3 bits [7]. Using a recent technique introduced by Moody, Paul and Smith-Tone in [23], we are now able to improve the bound of JH to n/2 bits. This means that the JH hash function should be able to resist generic attacks with work-factor less than O(2^n/2). Our rigorous experiments have given ample evidence that the bound could be further improved, possibly up to 2n/3 bits, or more. Theoretical analysis of this experimental result is left as an open problem.
Conference: The Third SHA-3 Candidate Conference
Proceedings: None
Pages: 17 pp.
Location: Washington D.C., DC
Dates: March 22-23, 2012
Keywords: Hash functions; indifferentiability; SHA-3
Research Areas: Math, Computer Security, Cybersecurity
PDF version: PDF Document Click here to retrieve PDF version of paper (1MB)