Abstract
It is known that for a Boolean function to be “good” from the cryptographic point of view it should possess several cryptographic properties. Often such properties contradict each other. The problem of constructing bent functions with stronger cryptographic properties is again considered in this chapter. Here we concentrate on additional restrictions for bent functions that lead to new cryptographic notions (such as balanced bent functions and hyperbent functions) and also on modifications of bent functions by the following principle: “less nonlinearity, stronger other properties” (partially bent functions). We consider semibent functions, balanced (semi-) bent functions, partially bent functions, hyperbent functions, bent functions of higher order, and k-bent functions.
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.
