Characterizing Negabent Boolean Functions over Finite Fields
From MaRDI portal
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 , with the maximum possible degree, . These are the first ever constructions of negabent functions with trace representation that have optimal degree.
Recommendations
- scientific article; zbMATH DE number 493087
- Constructions of negabent functions over finite fields
- scientific article; zbMATH DE number 1962825
- On computing Boolean connectives of characteristic functions
- A characterization of Boolean algebras
- On the symmetric negabent Boolean functions
- Coding and Cryptography
- On complexity and depth of Boolean circuits for multiplication and inversion over finite fields of characteristic 2
- Equational characterizations of Boolean function classes
- Approximate evaluations of characteristic polynomials of Boolean functions
Cited in
(8)- On negabent functions and nega-Hadamard transform
- Modified planar functions and their components
- On the existence and non-existence of some classes of bent-negabent functions
- Bent and bent₄ spectra of Boolean functions over finite fields
- Several secondary methods for constructing bent-negabent functions
- scientific article; zbMATH DE number 493087 (Why is no real title available?)
- On computing Boolean connectives of characteristic functions
- Constructions of negabent functions over finite fields
This page was built for publication: Characterizing Negabent Boolean Functions over Finite Fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2907279)