2000 character limit reached
Some Results on Bent-Negabent Boolean Functions over Finite Fields
Published 4 Jun 2014 in cs.IT and math.IT | (1406.1036v1)
Abstract: We consider negabent Boolean functions that have Trace representation. We completely characterize quadratic negabent monomial functions. We show the relation between negabent functions and bent functions via a quadratic function. Using this characterization, we give infinite classes of bent-negabent Boolean functions over the finite field $\F_{2n}$, with the maximum possible degree, $n \over 2$. These are the first ever constructions of negabent functions with trace representation that have optimal degree.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.