Paper 2008/385

Cube Attacks on Tweakable Black Box Polynomials

Itai Dinur and Adi Shamir

Abstract

Almost any cryptographic scheme can be described by \emph{tweakable polynomials} over $GF(2)$, which contain both secret variables (e.g., key bits) and public variables (e.g., plaintext bits or IV bits). The cryptanalyst is allowed to tweak the polynomials by choosing arbitrary values for the public variables, and his goal is to solve the resultant system of polynomial equations in terms of their common secret variables. In this paper we develop a new technique (called a \emph{cube attack}) for solving such tweakable polynomials, which is a major improvement over several previously published attacks of the same type. For example, on the stream cipher Trivium with a reduced number of initialization rounds, the best previous attack (due to Fischer, Khazaei, and Meier) requires a barely practical complexity of $$ to attack $$ initialization rounds, whereas a cube attack can find the complete key of the same variant in $$ bit operations (which take less than a second on a single PC). Trivium with $$ initialization rounds (which could not be attacked by any previous technique) can now be broken with $$ bit operations. Trivium with $$ initialization rounds can now be broken with $$ bit operations, and the complexity of the attack can almost certainly be further reduced to about $$ bit operations. Whereas previous attacks were heuristic, had to be adapted to each cryptosystem, had no general complexity bounds, and were not expected to succeed on random looking polynomials, cube attacks are provably successful when applied to random polynomials of degree $$ over $$ secret variables whenever the number $$ of public variables exceeds $$. Their complexity is $$ bit operations, which is polynomial in $$ and amazingly low when $$ is small. Cube attacks can be applied to any block cipher, stream cipher, or MAC which is provided as a black box (even when nothing is known about its internal structure) as long as at least one output bit can be represented by (an unknown) polynomial of relatively low degree in the secret and public variables.

Note: The Trivium results are updated, and the paper is revised according to several reviews.