Cryptology ePrint Archive: Report 2014/259

Practical Complexity Cube Attacks on Round-Reduced Keccak Sponge Function

Itai Dinur and Pawel Morawiecki and Josef Pieprzyk and Marian Srebrny and 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.

Category / Keywords: secret-key cryptography / Keccak, SHA-3, sponge function, cube attack

Date: received 12 Apr 2014

Contact author: pawel morawiecki at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20140420:153210 (All versions of this report)

Short URL: ia.cr/2014/259