Papers
Topics
Authors
Recent
Search
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.

Citations (1)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.