On the Resistance of Boolean Functions Against Algebraic Attacks Using Univariate Polynomial Representation

In the past few years, algebraic attacks against stream ciphers with linear feedback function have been significantly improved. As a response to the new attacks, the notion of algebraic immunity of a Boolean function f was introduced, defined as the minimum degree of the annihilators of f and f + 1. An annihilator of f is a nonzero Boolean function g , such that f · g = 0. While several constructions of Boolean functions with optimal algebraic immunity have been proposed, there is no significant progress concerning the resistance against the so-called fast algebraic attacks. In this paper, we provide a framework to assess the resistance of Boolean functions against the new algebraic attacks, including fast algebraic attacks. The analysis is based on the univariate polynomial representation of Boolean functions and necessary and sufficient conditions are presented for a Boolean function to have optimal behavior against all the new algebraic attacks. Finally, we introduce a new infinite family of balanced Boolean functions described by their univariate polynomial representation. By applying the new framework, we prove that all the members of the family have optimal algebraic immunity and we efficiently evaluate their behavior against fast algebraic attacks.

[1]  K. Conrad,et al.  Finite Fields , 2018, Series and Products in the Development of Mathematics.

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

[3]  Claude Carlet,et al.  An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity , 2008, ASIACRYPT.

[4]  Keisuke Shiromoto.  Second Support Weights for Binary Self-dual Codes , 2005, WCC.

[5]  Rudolf Lide,et al.  Finite fields , 1983 .

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

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

[8]  Frédéric Didier.  Using Wiedemann's Algorithm to Compute the Immunity Against Algebraic and Fast Algebraic Attacks , 2006, INDOCRYPT.

[9]  Jing Yang,et al.  Maximal values of generalized algebraic immunity , 2009, Des. Codes Cryptogr..

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

[11]  Na Li,et al.  On the Construction of Boolean Functions With Optimal Algebraic Immunity , 2008, IEEE Transactions on Information Theory.

[12]  Bart Preneel,et al.  On the Algebraic Immunity of Symmetric Boolean Functions , 2005, INDOCRYPT.

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

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

[15]  Anne Canteaut,et al.  Open Problems Related to Algebraic Attacks on Stream Ciphers , 2005, WCC.

[16]  Nicolas Courtois.  Cryptanalysis of Sfinks , 2005, ICISC.

[17]  Frederik Armknecht,et al.  Constructing Single- and Multi-output Boolean Functions with Maximal Algebraic Immunity , 2006, ICALP.

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

[19]  Philip Hawkes,et al.  Rewriting Variables: The Complexity of Fast Algebraic Attacks on Stream Ciphers , 2004, CRYPTO.

[20]  Gema María Díaz-Toca,et al.  The Berlekamp-Massey Algorithm revisited , 2005, Applicable Algebra in Engineering, Communication and Computing.

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

[22]  James L. Massey,et al.  Shift-register synthesis and BCH decoding , 1969, IEEE Trans. Inf. Theory.

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

[24]  Wen-Feng Qi,et al.  Construction and Analysis of Boolean Functions of 2t+1 Variables with Maximum Algebraic Immunity , 2006, ASIACRYPT.