[Resource Topic] 2014/259: Practical Complexity Cube Attacks on Round-Reduced Keccak Sponge Function

Resource Secret-key cryptography
#1

Welcome to the resource topic for 2014/259

Title:
Practical Complexity Cube Attacks on Round-Reduced Keccak Sponge Function

Authors: Itai Dinur, Pawel Morawiecki, Josef Pieprzyk, Marian Srebrny, Michal Straus

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.

ePrint: https://eprint.iacr.org/2014/259

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .