Abstract
The rth-order nonlinearity of a Boolean function is an important cryptographic criterion in analysing the security of stream ciphers and block ciphers. In this paper, we compute the lower bounds on the (r=d)th-order nonlinearity of Kasami Boolean function , where k=22d −2 d +1. We also compare the values of lower bound obtained in a theorem in this paper to the values of general lower bound obtained by Carlet [Recursive lower bounds on the nonlinearity profile of Boolean functions and their applications, IEEE Trans. Inform. Theory 54(3) (2008), pp. 1262–1272]. It is also shown that our lower bound is better than the lower bound obtained by Carlet.
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.
