Improved Indifferentiability Security Bound for the JH Mode

Dustin Moody, Souradyuti Paul, Daniel Smith-Tone

2012 · 10 citations · 2 references

Concepts

Abstract

The JH hash function is one of the five finalists of the ongoing NIST SHA3 hash function competition. Despite several earlier attempts, and years of analysis, the indifferentiability 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 improve the bound of JH to n/2 bits. We also performed experiments which verify the theoretically obtained results. 1

References

2