Abstract

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.

Full Text
Paper version not known

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.