Abstract
Studying Boolean functions with high algebraic immunity (i.e., which can provide some kind of resistance against algebraic attack) has attracted much attention recently. In FSE 2005, Dalai, Gupta and Maitra presented the first construction of Boolean functions achieving maximum possible algebraic immunity. However, the important cryptographic properties, such as algebraic degree and nonlinearity, of the Boolean functions constructed using that method could not be answered, except (by experiment) when the number of variables was small (at most 16). In this paper we solve this problem for every number of variables. Further we study the structure of the construction in detail, and we deduce an algorithm for fast evaluation of the functions, which is crucial for a practical use in stream ciphers.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
