Paper 2014/259 Original: eprint.iacr.org/2014/259 ↗
Practical Complexity Cube Attacks on Round-Reduced Keccak Sponge Function
Abstract
In this paper we mount the cube attack on the Keccak sponge function. The cube attack, formally introduced in 2008, is an algebraic technique applicable to cryptographic primitives whose output can be described as a low-degree polynomial in the input. Our results show that 5- and 6-round Keccak sponge function is vulnerable to this technique. All the presented attacks have practical complexities and were verified on a desktop PC.
Metadata
- Available format(s)
PDF- Category
- Secret-key cryptography
- Publication info
- Preprint.
- History
- 2014-04-20: last updated
- 2014-04-20: published
- Short URL
- https://ia.cr/2014/259
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2014/259,
author = {Itai Dinur and Pawel Morawiecki and Josef Pieprzyk and Marian Srebrny and Michal Straus},
title = {Practical Complexity Cube Attacks on Round-Reduced Keccak Sponge Function},
howpublished = {Cryptology {ePrint} Archive, Paper 2014/259},
year = {2014},
url = {https://eprint.iacr.org/2014/259}
}