Single block attacks and statistical tests on CubeHash

Show simple item record

dc.contributor.author Kaminsky, Alan
dc.contributor.author Bloom, Benjamin
dc.date.accessioned 2009-08-28T14:12:08Z
dc.date.available 2009-08-28T14:12:08Z
dc.date.issued 2009
dc.identifier.uri http://hdl.handle.net/1850/10452
dc.description.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.
dc.language.iso en_US
dc.publisher Department of Computer Science, Rochester Institute of Technology
dc.subject CubeHash en_US
dc.subject Cryptanalysis en_US
dc.subject Hash functions en_US
dc.subject Secret-key cryptography en_US
dc.subject Statistical randomness tests en_US
dc.title Single block attacks and statistical tests on CubeHash
dc.type Technical Report
dc.description.college B. Thomas Golisano College of Computing and Information Sciences
dc.description.department Department of Computer Science
dc.description.school Rochester Institute of Technology

Files in this item

Files Size Format View
AKaminskyTechReport08-21-2009.pdf 196.6Kb PDF View/Open

This item appears in the following Collection(s)

Show simple item record

Search RIT DML


Advanced Search

Browse