Advertisement
Published in:
2009 | OriginalPaper | Chapter
Cryptanalysis of CubeHash
Authors : Eric Brier, Thomas Peyrin
Published in: Applied Cryptography and Network Security
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
CubeHash
is a family of hash functions submitted by Bernstein as a
SHA-3
candidate. In this paper, we provide two different cryptanalysis approaches concerning its collision resistance. Thanks to the first approach, related to truncated differentials, we computed a collision for the
CubeHash
-1/36 hash function, i.e. when for each iteration 36 bytes of message are incorporated and one call to the permutation is applied. Then, the second approach, already used by Dai, much more efficient and based on a linearization of the scheme, allowed us to compute a collision for the
CubeHash
-2/4 hash function. Finally, a theoretical collision attack against
CubeHash
-2/3,
CubeHash
-4/4 and
CubeHash
-4/3 is described. This is currently by far the best known cryptanalysis result on this
SHA-3
candidate.