Paper 2011/550
A New Distinguisher for CubeHash-8/b and CubeHash-15/b Compression Functions
Javad Alizadeh and Abdolrasoul Mirghadri
Abstract
CubeHash is one of the round 2 candidates of the public SHA-3 competition hosted by NIST. It was designed by Bernstein. In this paper we find a new distinguisher to distinguish CubeHash compression function from a random function. This distinguisher principle is based on rotational analysis that formally introduced by Khovratovich and Nikolic. In order to use this technique, we need to compute the probability that four swap functions in CubeHash round function preserve the rotational property for any input pair. We compute these probabilities and find a new distinguisher that distinguish CubeHash-8/b and CubeHash-15/b compression function from a random function with probability greater than and , respectively. Until we know this is the first distinguisher for CubeHash compression function with more than 14 rounds.
Note: There is an writing mistake in published version (Appendix in the paper was written before references)
Metadata
- Available format(s)
-
PDF
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- SHA-3 candidateCubeHashrotational analysisdistinguisher
- Contact author(s)
- alizadja @ gmail com
- History
- 2011-10-12: revised
- 2011-10-11: received
- See all versions
- Short URL
- https://ia.cr/2011/550
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2011/550,
author = {Javad Alizadeh and Abdolrasoul Mirghadri},
title = {A New Distinguisher for CubeHash-8/b and CubeHash-15/b Compression Functions},
howpublished = {Cryptology ePrint Archive, Paper 2011/550},
year = {2011},
note = {\url{https://eprint.iacr.org/2011/550}},
url = {https://eprint.iacr.org/2011/550}
}
