Abstract
Three of the most essential criteria for cryptographically strong Boolean functions are balancedness, high nonlinearity and high algebraic degree. In this paper, we give two methods for constructing balanced Boolean functions with high nonlinearity via modifying Maiorana–McFarland type bent functions. The algebraic immunity of the constructed functions is also considered.
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.
