Construction of Rotation Symmetric Boolean Functions on Odd Number of Variables with Maximum Algebraic Immunity

In this paper we present a theoretical construction of Rotation Symmetric Boolean Functions (RSBFs) on odd number of variables with maximum possible algebraic immunity (AI) and further these functions are not symmetric. Our RSBFs are of better nonlinearity than the existing theoretical constructions with maximum possible AI. To get very good nonlinearity, which is important for practical cryptographic design, we generalize our construction to a construction cum search technique in the RSBF class. We find 7, 9, 11 variable RSBFs with maximum possible AI having nonlinearities 56, 240, 984 respectively with very small amount of search after our basic construction.

[1]  Tanja Lange,et al.  Progress in Cryptology - INDOCRYPT 2006, 7th International Conference on Cryptology in India, Kolkata, India, December 11-13, 2006, Proceedings , 2006, INDOCRYPT.

[2]  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.

[3]  Tor Helleseth,et al.  Sequences and Their Applications - SETA 2006, 4th International Conference, Beijing, China, September 24-28, 2006, Proceedings , 2006, SETA.

[4]  Selçuk Kavut,et al.  Enumeration of 9-Variable Rotation Symmetric Boolean Functions Having Nonlinearity > 240 , 2006, INDOCRYPT.

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

[6]  Pantelimon Stanica,et al.  Rotation symmetric Boolean functions - Count and cryptographic properties , 2003, Discret. Appl. Math..

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

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

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

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

[11]  Wen-Feng Qi,et al.  Symmetric Boolean functions depending on an odd number of variables with maximum algebraic immunity , 2006, IEEE Trans. Inf. Theory.

[12]  Kefei Chen,et al.  Advances in Cryptology - ASIACRYPT 2006, 12th International Conference on the Theory and Application of Cryptology and Information Security, Shanghai, China, December 3-7, 2006, Proceedings , 2006, ASIACRYPT.

[13]  Mikhail Lobanov.  Tight bound between nonlinearity and algebraic immunity , 2005, IACR Cryptol. ePrint Arch..

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

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

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

[17]  Chao Li,et al.  A Note on Symmetric Boolean Functions With Maximum Algebraic Immunity in Odd Number of Variables , 2007, IEEE Transactions on Information Theory.

[18]  Subhamoy Maitra,et al.  Reducing the Number of Homogeneous Linear Equations in Finding Annihilators , 2006, SETA.