Abstract
Let n=2m. In the present paper, we study the binomial Boolean functions of the formfa,b(x)=Tr1n(ax2m−1)+Tr12(bx2n−13), where m is an even positive integer, a∈F2n⁎ and b∈F4⁎. We show that fa,b is a bent function if the Kloosterman sumKm(a2m+1)=1+∑x∈F2m⁎(−1)Tr1m(a2m+1x+1x) equals 4, thus settling an open problem of Mesnager. The proof employs tools including computing Walsh coefficients of Boolean functions via multiplicative characters, divisibility properties of Gauss sums, and graph theory.
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.
