Open Problems Related to Algebraic Attacks on Stream Ciphers

The recently developed algebraic attacks apply to all keystream generators whose internal state is updated by a linear transition function, including LFSR-based generators. Here, we describe this type of attacks and we present some open problems related to their complexity. We also investigate the design criteria which may guarantee a high resistance to algebraic attacks for keystream generators based on a linear transition function.

[1]  Jennifer D. Key,et al.  Information sets and partial permutation decoding for codes from finite geometries , 2006, Finite Fields Their Appl..

[2]  Antoine Joux,et al.  Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gröbner Bases , 2003, CRYPTO.

[3]  Nicolas Courtois.  Algebraic Attacks on Combiners with Memory and Several Outputs , 2003, ICISC.

[4]  Enes Pasalic.  On algebraic immunity of Maiorana-McFarland like functions and applications of algebraic attacks to some stream cipher schemes , .

[5]  Claude Carlet,et al.  On a New Notion of Nonlinearity Relevant to Multi-output Pseudo-random Generators , 2003, Selected Areas in Cryptography.

[6]  Hideki Imai,et al.  Comparison Between XL and Gröbner Basis Algorithms , 2004, ASIACRYPT.

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

[8]  Ross J. Anderson.  Searching for the Optimum Correlation Attack , 1994, FSE.

[9]  Subhamoy Maitra,et al.  Basic Theory in Construction of Boolean Functions with Maximum Possible Annihilator Immunity , 2006, Des. Codes Cryptogr..

[10]  Don Coppersmith,et al.  Matrix multiplication via arithmetic progressions , 1987, STOC.

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

[12]  Claus Diem,et al.  The XL-Algorithm and a Conjecture from Commutative Algebra , 2004, ASIACRYPT.

[13]  B. Salvy,et al.  Asymptotic Behaviour of the Degree of Regularity of Semi-Regular Polynomial Systems , 2022 .

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

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

[16]  Subhamoy Maitra,et al.  Cryptographically Significant Boolean Functions: Construction and Analysis in Terms of Algebraic Immunity , 2005, FSE.

[17]  Jennifer D. Key,et al.  Partial permutation decoding for codes from finite planes , 2005, Eur. J. Comb..

[18]  Subhamoy Maitra,et al.  Results on Algebraic Immunity for Cryptographically Significant Boolean Functions , 2004, INDOCRYPT.

[19]  Claude E. Shannon,et al.  Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

[20]  Frederik Armknecht.  Algebraic Attacks and Annihilators , 2005, WEWoRC.

[21]  J. Faugère.  A new efficient algorithm for computing Gröbner bases (F4) , 1999 .

[22]  Jean Charles Faugère,et al.  A new efficient algorithm for computing Gröbner bases without reduction to zero (F5) , 2002, ISSAC '02.

[23]  Jean-Charles Faugère,et al.  An Algebraic Cryptanalysis of Nonlinear Filter Generators using Gröbner bases , 2003 .

[24]  Frederik Armknecht,et al.  Improving Fast Algebraic Attacks , 2004, FSE.

[25]  Agnes Hui Chan,et al.  Maximum Correlation Analysis of Nonlinear S-boxes in Stream Ciphers , 2000, CRYPTO.

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

[27]  Josef Pieprzyk,et al.  Cryptanalysis of Block Ciphers with Overdefined Systems of Equations , 2002, ASIACRYPT.

[28]  J. Faugère,et al.  On the complexity of Gröbner basis computation of semi-regular overdetermined algebraic equations , 2004 .