Effective Construction of a Class of Bent Quadratic Boolean Functions
Chunming Tang, Yanfeng Qi

TL;DR
This paper characterizes the bentness of a specific class of quadratic Boolean functions, providing explicit results for cases where the parameter m has particular factorizations, and enumerates functions in a special case.
Contribution
It offers new criteria for determining bentness of quadratic Boolean functions for specific m factorizations and enumerates such functions when m=2^vpq.
Findings
Bentness characterized for m=2^vp^r and m=2^vpq cases.
Explicit enumeration of quadratic bent functions for m=2^vpq.
Provides conditions under which these functions are bent.
Abstract
In this paper, we consider the characterization of the bentness of quadratic Boolean functions of the form where , is even and . For a general , it is difficult to determine the bentness of these functions. We present the bentness of quadratic Boolean function for two cases: and , where and are two distinct primes. Further, we give the enumeration of quadratic bent functions for the case .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Cryptographic Implementations and Security · graph theory and CDMA systems
