Difference between revisions of "CubeHash"

From The ECRYPT Hash Function Website
(Cryptanalysis)
m (Cryptanalysis)
Line 25: Line 25:
 
   howpublished = {Cryptology ePrint Archive, Report 2008/486},
 
   howpublished = {Cryptology ePrint Archive, Report 2008/486},
 
   year      = {2008},
 
   year      = {2008},
 +
  abstract  = {Bernstein’s CubeHash is a hash function family that includes four functions submitted to the NIST Hash Competition. A CubeHash function is parametrized by a number of rounds r, a block byte size b, and a digest bit length h. The 1024-bit internal state of CubeHash is represented as a five-dimension hypercube. Submissions to NIST have r = 8, b = 1, and $h \in {224, 256, 384, 512}$.
 +
This paper gives the first external analysis of CubeHash, with
 +
- improved standard generic attacks for collisions and preimages
 +
- a multicollision attack that exploits fixed points
 +
- a study of the round function symmetries
 +
- a preimage attack that exploits these symmetries
 +
- a practical collision attack on a weakened version of CubeHash
 +
- high-probability truncated differentials over the 8-round transform
 +
Our results do not contradict the security claims about CubeHash.},
 
}
 
}
 
</bibtex>
 
</bibtex>

Revision as of 13:08, 1 December 2008