Single Block Attacks and Statistical Tests on CubeHash

The authors have reported an attack on the CubeHash one-way hash function that finds a second pre-image consisting of a single message block. The attack requires minimal memory and was implemented as a massively parallel Java program running on a hybrid parallel computer. The attack requires less time than brute force search for reduced-strength CubeHash variants, but does not break the variants recommended for SHA-3. From statistical tests based on the single block attack, they found no reason to disbelieve that CubeHash behaves as a random mapping. These results support CubeHash's viability as a secure cryptographic hash function.

Provided by: Rochester Institute of Technology Topic: Software Date Added: Aug 2010 Format: PDF

Find By Topic