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.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call