Published: March 22, 2012
Author(s)
Dustin Moody, Souradyuti Paul, Daniel Smith
Conference
Name: The Third SHA-3 Candidate Conference
Dates: March 22-23, 2012
Location: Washington, DC, United States
Announcement
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. Using a recent technique introduced by Moody, Paul, and Smith-Tone in, we improve the bound of JH to n/2 bits. We also performed experiments which verify the theoretically obtained results.
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. Using a recent technique...
See full 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. Using a recent technique introduced by Moody, Paul, and Smith-Tone in, we improve the bound of JH to n/2 bits. We also performed experiments which verify the theoretically obtained results.
Hide full abstract
Keywords
hash algorithm; indifferentiability
Control Families
None selected
) or https:// don't prove our archive is authentic, only that you securely accessed it. Note that we are working to fix that :)
