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.
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.
