On Algebraic Immunity and Annihilators

Algebraic immunity AI(f) defined for a boolean function f measures the resistance of the function against algebraic attacks. Currently known algorithms for computing the optimal annihilator of f and AI(f) are inefficient. This work consists of two parts. In the first part, we extend the concept of algebraic immunity. In particular, we argue that a function f may be replaced by another boolean function fc called the algebraic complement of f. This motivates us to examine AI(fc). We define the extended algebraic immunity of f as AI*(f)= min {AI(f), AI(fc)}. We prove that 0≤AI(f)–AI*(f)≤1. Since AI(f)–AI*(f)= 1 holds for a large number of cases, the difference between AI(f) and AI*(f) cannot be ignored in algebraic attacks. In the second part, we link boolean functions to hypergraphs so that we can apply known results in hypergraph theory to boolean functions. This not only allows us to find annihilators in a fast and simple way but also provides a good estimation of the upper bound on AI*(f).

[1]  Anne Canteaut,et al.  Progress in Cryptology - INDOCRYPT 2004, 5th International Conference on Cryptology in India, Chennai, India, December 20-22, 2004, Proceedings , 2004, INDOCRYPT.

[2]  Martin Grötschel,et al.  Handbook of combinatorics (vol. 1) , 1996 .

[3]  Aggelos Kiayias,et al.  Polynomial Reconstruction Based Cryptography , 2001, Selected Areas in Cryptography.

[4]  Hideki Imai,et al.  Restriction, Terms and Nonlinearity of Boolean Functions , 1999, Theor. Comput. Sci..

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

[6]  Nicolas Courtois,et al.  Higher Order Correlation Attacks, XL Algorithm and Cryptanalysis of Toyocrypt , 2002, ICISC.

[7]  Palash Sarkar,et al.  Nonlinearity Bounds and Constructions of Resilient Boolean Functions , 2000, CRYPTO.

[8]  Gerhard Goos,et al.  Fast Software Encryption , 2001, Lecture Notes in Computer Science.

[9]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[10]  László Lovász,et al.  On the ratio of optimal integral and fractional covers , 1975, Discret. Math..

[11]  S. K Stein,et al.  Two Combinatorial Covering Theorems , 1974, J. Comb. Theory, Ser. A.

[12]  Frederik Armknecht,et al.  Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks , 2006, EUROCRYPT.

[13]  Serge Vaudenay,et al.  Advances in Cryptology - EUROCRYPT 2006 , 2006, Lecture Notes in Computer Science.

[14]  Dan Boneh,et al.  Advances in Cryptology - CRYPTO 2003 , 2003, Lecture Notes in Computer Science.

[15]  R. Graham,et al.  Handbook of Combinatorics , 1995 .

[16]  Guang Gong,et al.  Upper Bounds on Algebraic Immunity of Boolean Power Functions , 2006, FSE.

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

[18]  Jean-Pierre Tillich,et al.  Computing the Algebraic Immunity Efficiently , 2006, FSE.

[19]  William Millan,et al.  LILI Keystream Generator , 2000, Selected Areas in Cryptography.

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

[21]  Mihir Bellare.  Advances in Cryptology — CRYPTO 2000 , 2000, Lecture Notes in Computer Science.

[22]  Chae Hoon Lim,et al.  Information Security and Cryptology — ICISC 2002 , 2003, Lecture Notes in Computer Science.

[23]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

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

[25]  Solomon W. Golomb,et al.  Shift Register Sequences , 1981 .

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

[27]  Aggelos Kiayias,et al.  Traceable Signatures , 2004, EUROCRYPT.

[28]  Claude Carlet,et al.  Algebraic immunity for cryptographically significant Boolean functions: analysis and construction , 2006, IEEE Transactions on Information Theory.