Cube-Type Algebraic Attacks on Wireless Encryption Protocols

Formally evaluating the strengths of a given cryptosystem will ensure that no flaws have crept into the application. During our investigation, we adopted Armknecht and Krause's approach to model the E0 encryption function, which does not depend on memory bits and will hold for every clock tick. We devised a polynomial of degree four consisting of 20 variables, 16 considered unknown and four known. We then created an automated tool in the Maple 12 environment (www. maplesoft.com) that finds all the maxterms and their corresponding linear-coefficient superpolys for the E0 encryption function.

[1]  Roger M. Needham,et al.  Using encryption for authentication in large networks of computers , 1978, CACM.

[2]  Thomas Siegenthaler,et al.  Correlation-immunity of nonlinear combining functions for cryptographic applications , 1984, IEEE Trans. Inf. Theory.

[3]  Adi Shamir,et al.  Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations , 2000, EUROCRYPT.

[4]  Adi Shamir,et al.  Cube Attacks on Tweakable Black Box Polynomials , 2009, IACR Cryptol. ePrint Arch..

[5]  Claude Carlet,et al.  Algebraic Attacks and Decomposition of Boolean Functions , 2004, EUROCRYPT.

[6]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7]  Giampaolo Bella,et al.  Formal Correctness of Security Protocols , 2007 .

[8]  Serge Vaudenay,et al.  Faster Correlation Attack on Bluetooth Keystream Generator E0 , 2004, CRYPTO.

[9]  Frederik Armknecht.  ALGEBRAIC ATTACKS ON STREAM CIPHERS , 2004 .

[10]  Willi Meier,et al.  The Conditional Correlation Attack: A Practical Attack on Bluetooth Encryption , 2005, CRYPTO.

[11]  Douglas R. Stinson,et al.  Cryptography: Theory and Practice , 1995 .

[12]  Frederik Armknecht,et al.  Algebraic Attacks on Combiners with Memory , 2003, CRYPTO.

[13]  Sean O'Neil.  Algebraic Structure Defectoscopy , 2007, IACR Cryptol. ePrint Arch..

[14]  Nicolas Courtois.  Fast Algebraic Attacks on Stream Ciphers with Linear Feedback , 2003, CRYPTO.

[15]  B. Buchberger,et al.  Gröbner bases and applications , 1998 .

[16]  John B. Fraleigh.  A first course in abstract algebra , 1967 .

[17]  Pantelimon Stanica,et al.  Cryptographic Boolean Functions and Applications , 2009 .

[18]  Kenneth H. Rosen,et al.  Discrete Mathematics and its applications , 2000 .

[19]  Josef Pieprzyk,et al.  Extensions of the Cube Attack Based on Low Degree Annihilators , 2009, CANS.

[20]  Of references. , 1966, JAMA.

[21]  Richard Mollin.  Codes: The Guide to Secrecy From Ancient to Modern Times , 2005 .

[22]  Shahram Khazaei,et al.  Chosen IV Statistical Analysis for Key Recovery Attacks on Stream Ciphers , 2008, AFRICACRYPT.

[23]  J. Rotman.  A First Course in Abstract Algebra , 1995 .

[24]  Aviel D. Rubin.  White-Hat Security Arsenal: Tackling the Threats , 2001 .

[25]  Willi Meier,et al.  Fast Algebraic Attacks on Stream Ciphers with Linear Feedback , 2003, CRYPTO.

[26]  Antoine Joux,et al.  A Chosen IV Attack Against Turing , 2003, Selected Areas in Cryptography.

[27]  Shahram Khazaei,et al.  Reduced Complexity Attacks on the Alternating Step Generator , 2007, Selected Areas in Cryptography.