Welcome to the resource topic for 2009/407
Title:
Single Block Attacks and Statistical Tests on CubeHash
Authors: Benjamin Bloom, Alan Kaminsky
Abstract:This paper describes a second preimage attack on the CubeHash cryptographic one-way hash function. The attack finds a second preimage in less time than brute force search for these CubeHash variants: CubeHash r/b-224 for b > 100; CubeHash$r$/b-256 for b > 96; CubeHash$r$/b-384 for b > 80; and CubeHash$r$/b-512 for b > 64. However, the attack does not break the CubeHash variants recommended for SHA-3. The attack requires minimal memory and can be performed in a massively parallel fashion. This paper also describes several statistical randomness tests on CubeHash. The tests were unable to disprove the hypothesis that CubeHash behaves as a random mapping. These results support CubeHash’s viability as a secure cryptographic hash function.
ePrint: https://eprint.iacr.org/2009/407
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .