Characterization of Negabent Functions and Construction of Bent-Negabent Functions with Maximum Algebraic Degree
Wei Su, Alexander Pott, and Xiaohu Tang

TL;DR
This paper characterizes negabent functions, explores their spectral properties, and introduces a construction method for bent-negabent functions with maximum algebraic degree, solving two open problems in the field.
Contribution
It provides necessary and sufficient conditions for negabent functions, analyzes their spectra, and constructs bent-negabent functions with maximum algebraic degree, advancing understanding of their structure.
Findings
Negabent functions have at most 4 nega spectrum values.
The nega spectrum distribution of negabent functions is determined.
Maximum algebraic degree of bent-negabent functions is n/2 for even n.
Abstract
We present necessary and sufficient conditions for a Boolean function to be a negabent function for both even and odd number of variables, which demonstrate the relationship between negabent functions and bent functions. By using these necessary and sufficient conditions for Boolean functions to be negabent, we obtain that the nega spectrum of a negabent function has at most 4 values. We determine the nega spectrum distribution of negabent functions. Further, we provide a method to construct bent-negabent functions in variables ( even) of algebraic degree ranging from 2 to , which implies that the maximum algebraic degree of an -variable bent-negabent function is equal to . Thus, we answer two open problems proposed by Parker and Pott and by St\v{a}nic\v{a} \textit{et al.} respectively.
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 · Neuropeptides and Animal Physiology
