Paper 2010/506
Quantum Preimage and Collision Attacks on CubeHash
Gaëtan Leurent
Abstract
In this paper we show a quantum preimage attack on CubeHash-512-normal with complexity 2^192 . This kind of attack is expected to cost 2^256 for a good 512-bit hash function, and we argue that this violates the expected security of CubeHash. The preimage attack can also be used as a collision attack, given that a generic quantum collision attack on a 512-bit hash function require 2^256 operations, as explained in the CubeHash submission document. This attack only uses very simple techniques, most of which are borrowed from previous analysis of CubeHash: we just combine symmetry based attacks [1,8] with Grover's algorithm. However, it is arguably the first attack on a second-round SHA-3 candidate that is more efficient than the attacks considered by the designer.
Metadata
- Available format(s)
-
PDF
- Category
- Secret-key cryptography
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- Hash functionsSHA-3CubeHash
- Contact author(s)
- gaetan leurent @ ens fr
- History
- 2010-11-30: revised
- 2010-10-05: received
- See all versions
- Short URL
- https://ia.cr/2010/506
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2010/506,
author = {Gaëtan Leurent},
title = {Quantum Preimage and Collision Attacks on {CubeHash}},
howpublished = {Cryptology {ePrint} Archive, Paper 2010/506},
year = {2010},
url = {https://eprint.iacr.org/2010/506}
}
