Research on optimization strategy of construction methods of Boolean functions

Considering the algebraic immunity (AI) as one of the most important characteristics that evaluates the resistance against algebraic attacks, the construction methods of Boolean functions which have good performance both on algebraic and other form attacks have received a lot of attention in the cryptographic research area. In this paper, we study certain properties of Boolean functions especially their algebraic immunity. Next, we analyse some exiting construction methods and show that the most important process of the whole construction is the searching course. Further, we give some specific optimization strategies of the construction of Boolean functions and make a comparison between the performances of these methods.