摘要

Because of the algebraic attacks, a high algebraic immunity is now an important criteria for Boolean functions used in stream ciphers. In this paper, we study the construction of Boolean functions with maximum algebraic immunity. We first present a new method to construct Boolean functions, in any number of variables, with maximum algebraic immunity(AI), and we also improve our algorithm to construct balanced functions with optimum algebraic immunity for any even number of variables. Furthermore, the enumeration and algebraic degree of the constructed Boolean functions are investigated.

全文