Abstract
Boolean functions with maximum algebraic immunity have been considered as one class of cryptographically significant functions. It is known that Boolean functions on odd variables have maximum algebraic immunity if and only if a correlative matrix has column full rank, and Boolean functions on even variables have maximum algebraic immunity if and only if two correlative matrices have column full rank. Recently, a smaller matrix was used in the odd case. We find that one or two smaller matrices can be used in the even case and consequently present several sufficient and necessary conditions for Boolean functions with maximum algebraic immunity. This result advances the ability to identify whether Boolean functions on even variables achieve maximum algebraic immunity. We also present a construction algorithm for n-variable Boolean functions with maximum algebraic immunity, specially with the Hamming weights of \( \sum {_{i = 0}^{\left\lceil {\frac{n} {2}} \right\rceil - 1} } \left( {\begin{array}{*{20}c} n \\ i \\ \end{array} } \right) \). It is easily realized for not too large n and helps construct balanced Boolean functions with maximum algebraic immunity on even variables. Furthermore, we present a sufficient and necessary condition for balanced Boolean functions to achieve maximum algebraic immunity and optimum algebraic degree, and modify the construction algorithm to construct Boolean functions on odd variables with maximum algebraic immunity, optimum algebraic degree and high nonlinearity.
Similar content being viewed by others
References
Courtois N, Meier W. Algebraic attacks on stream ciphers with linear feedback. In: Advances in Cryptology-EUROCRYPT 2003, LNCS Vol. 2656. Berlin, Heidelberg: Springer, 2003. 345–359
Courtois N. Fast algebraic attacks on stream ciphers with linear feedback. In: Advances in Cryptology-CRYPTO 2003, LNCS Vol. 2729. Berlin, Heidelberg: Springer, 2003. 176–194
Meier W, Pasalic E, Carlet C. Algebraic attacks and decomposition of Boolean functions. In: Advances in Cryptology-EUROCRYPT 2004, LNCS Vol. 3027. Berlin, Heidelberg: Springer, 2004. 474–491
Dalai D K, Gupta K C, Maitra S. Cryptographically significant Boolean functions: Construction and analysis in terms of algebraic immunity. In: FSE 2005, LNCS Vol. 3557. Berlin, Heidelberg: Springer, 2005. 98–111
Dalai D K, Maitra S, Sarkar S. Basic theory in construction of Boolean functions with maximum possible annihilator immunity. Design Code Cryptography, 2006, 40: 41–58
Braeken A, Preneel B. On the algebraic immunity of symmetric Boolean functions. In: Progress in Cryptology-INDOCRYPT 2005, LNCS Vol. 3797. Berlin, Heidelberg: Springer, 2005. 35–48
Qu L J, Li C, Feng K Q. A note on symmetric Boolean functions with maximum algebraic immunity in oddnumber of variables. IEEE Trans Inf Theory, 2007, 53: 2908–2910
Qu LJ, Li C. On the 2m-variable symmetric Boolean functions with maximum algebraic immunity. Sci China Ser F-Inf Sci, 2008, 51: 120–127
Li N, Qi W F. Symmetric Boolean function with maximum algebraic immunity depending on an odd number of variables. IEEE Trans Inf Theory, 2006, 52: 2271–2273
Qu L J, Feng G Z, Li C. On the Boolean functions with maximum possible algebraic immunity: construction and a lower bound of the count. Available at http://eprint.iacr.org/2005/449
Li N, Qi W F. Construction and count of Boolean functions of an odd number of variables with maximum algebraic immunity. Available at http://arxiv.org/abs/cs/0605139
Li N, Qu L J, Qi W F, et al. On the construction of Boolean Functions with optimal algebraic immunity. IEEE Trans Inf Theory, 2008, 54: 1330–1334
Li N, Qi W F. Boolean functions of an odd number of variables with maximum algebraic immunity. Sci China Ser F-Inf Sci, 2007, 50: 307–317
Carlet C. A method of construction of balanced functions with optimum algebraic immunity. Available at http://eprint.iacr.org/2006/149
Carlet C, Feng K Q. An infinite class of balanced functions with optimal algebraic immunity, good immunity to fast algebraic attacks and good nonlinearity. In: ASIACRYPT 2008, LNCS Vol. 5350. Berlin, Heidelberg: Springer, 2008. 425–440
Zhang W Y, Wu C K, Liu X Z. Construction and enumeration of Boolean functions with maximum algebraic immunity. Sci China Ser F-Inf Sci, 2009, 52: 32–40
Carlet C. Boolean functions for cryptography and error correcting codes. In: Crama Y, Hammer P, eds. Boolean Methods and Models. Cambridge: Cambridge University Press, in press
Canteaut A. Open problems related to algebraic attacks on stream ciphers. In: WCC 2005, LNCS Vol. 3969. Berlin, Heidelberg: Springer, 2006. 120–134
Dalai D K, Gupta K C, Maitra S. Results on algebraic immunity for cryptographically significant Boolean functions. In: Progress in Cryptology-INDOCRYPT 2004, LNCS Vol. 3348. Berlin, Heidelberg: Springer, 2005. 92–106
MacWilliams F J, Sloane N J A. The theory of error correcting codes. New York: North-Holland, 1977
Krasikov I, Litsyn S. On integral zeros of Krawtchouk polynomials. J Combin Theory Ser A, 1996, 74: 71–99
Lobanov M S. Exact relation between nonlinearity and algebraic immunity. Discrete Math Appl, 2006, 16: 453–460
Du Y S, Pei D Y. Construction of Boolean functions with maximum algebraic immunity and count of their annihilators at lowest degree. Sci China Inf Sci, 2010, 53: 780–787
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Liu, M., Pei, D. & Du, Y. Identification and construction of Boolean functions with maximum algebraic immunity. Sci. China Inf. Sci. 53, 1379–1396 (2010). https://doi.org/10.1007/s11432-010-3106-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11432-010-3106-x