Title: Enumeration of Even-Variable Boolean Functions with Maximum Algebraic Immunity
Abstract: Enumerating the Boolean functions satisfying one or several cryptographic criteria is useful. However, for a given number of variables, the number of Boolean functions with maximum AI is not known, either the previous known bound on the number is not good. In this paper, we investigate the enumeration of Boolean functions with maximum AI. First, we improve the lower bound on the number of even-variable Boolean functions with maximum AI, our new lower bound is better than the previous lower bounds. Then, for the first time, a significant lower bound on the number of 1-resilient Boolean functions with maximum AI is provided.
Publication Year: 2012
Publication Date: 2012-01-01
Language: en
Type: book-chapter
Indexed In: ['crossref']
Access and Citation
Cited By Count: 1
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot