Practical Complexity Cube Attacks on Round-Reduced Keccak Sponge Function

Itai Dinur; Pawel Morawiecki; Josef Pieprzyk; Marian Srebrny; Michal Straus

Practical Complexity Cube Attacks on Round-Reduced Keccak Sponge Function

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

Department of Computer Science

Research output: Working paper/Preprint › Preprint

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.

Original language	English
Publisher	IACR Cryptology ePrint Archive
Pages	259
Number of pages	1
State	Published - 2014

Publication series

Name	IACR Cryptology ePrint Archive

Access to Document

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

Cite this

@techreport{7fcc0f24d4a44a0eb480fcee302208b5,

title = "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.",

author = "Itai Dinur and Pawel Morawiecki and Josef Pieprzyk and Marian Srebrny and Michal Straus",

year = "2014",

language = "English",

series = "IACR Cryptology ePrint Archive",

publisher = "IACR Cryptology ePrint Archive",

pages = "259",

type = "WorkingPaper",

institution = "IACR Cryptology ePrint Archive",

}

TY - UNPB

T1 - Practical Complexity Cube Attacks on Round-Reduced Keccak Sponge Function

AU - Dinur, Itai

AU - Morawiecki, Pawel

AU - Pieprzyk, Josef

AU - Srebrny, Marian

AU - Straus, Michal

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

M3 - Preprint

T3 - IACR Cryptology ePrint Archive

SP - 259

BT - Practical Complexity Cube Attacks on Round-Reduced Keccak Sponge Function

PB - IACR Cryptology ePrint Archive

ER -

Practical Complexity Cube Attacks on Round-Reduced Keccak Sponge Function

Abstract

Publication series

Access to Document

Fingerprint

Cite this