Paper 2010/570

Breaking Grain-128 with Dynamic Cube Attacks

Itai Dinur and Adi Shamir

Abstract

We present a new variant of cube attacks called a \emph{dynamic cube attack}. Whereas standard cube attacks \cite{4} find the key by solving a system of linear equations in the key bits, the new attack recovers the secret key by exploiting distinguishers obtained from cube testers. Dynamic cube attacks can create lower degree representations of the given cipher, which makes it possible to attack schemes that resist all previously known attacks. In this paper we concentrate on the well-known stream cipher Grain-128 \cite{6}, on which the best known key recovery attack \cite{15} can recover only $$ key bits when the number of initialization rounds is decreased from $$ to $$. Our first attack runs in practical time complexity and recovers the full 128-bit key when the number of initialization rounds in Grain-128 is reduced to $$. Our second attack breaks a Grain-128 variant with $$ initialization rounds and is faster than exhaustive search by a factor of about $$. Finally, we present an attack on the full version of Grain-128 which can recover the full key but only when it belongs to a large subset of $$ of the possible keys. This attack is faster than exhaustive search over the $$ possible keys by a factor of about $$. All of our key recovery attacks are the best known so far, and their correctness was experimentally verified rather than extrapolated from smaller variants of the cipher. This is the first time that a cube attack was shown to be effective against the full version of a well known cipher which resisted all previous attacks.

Note: Updated according to comments by anonymous referees