Extensions of the Cube Attack Based on Low Degree Annihilators

At Crypto 2008, Shamir introduced a new algebraic attack called the cube attack, which allows us to solve black-box polynomials if we are able to tweak the inputs by varying an initialization vector. In a stream cipher setting where the filter function is known, we can extend it to the cube attack with annihilators: By applying the cube attack to Boolean functions for which we can find low-degree multiples (equivalently annihilators), the attack complexity can be improved. When the size of the filter function is smaller than the LFSR, we can improve the attack complexity further by considering a sliding window version of the cube attack with annihilators. Finally, we extend the cube attack to vectorial Boolean functions by finding implicit relations with low-degree polynomials. Keywords Cube Attack, Algebraic Attack, Low-Degree Annihilators.

• Type: Conference
• Year: 2009
• Where: CANS
• Authors: Aileen Zhang, Chu-Wee Lim, Khoongming Khoo, Lei Wei, Josef Pieprzyk
• Keywords: Algebraic Attack, Attack Complexity, CANS 2009, Cryptology, Cube Attack