Characterizing Negabent Boolean Functions over Finite Fields

  • Sumanta Sarkar
Conference paper

DOI: 10.1007/978-3-642-30615-0_7

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7280)
Cite this paper as:
Sarkar S. (2012) Characterizing Negabent Boolean Functions over Finite Fields. In: Helleseth T., Jedwab J. (eds) Sequences and Their Applications – SETA 2012. SETA 2012. Lecture Notes in Computer Science, vol 7280. Springer, Berlin, Heidelberg

Abstract

We consider negabent Boolean functions that have Trace representation. To the best of our knowledge, this is the first ever work on negabent functions with such representation. We completely characterize negabent quadratic monomial functions. We also present necessary and sufficient condition for a Maiorana-McFarland bent function to be a negabent function. As a consequence of that result we present a nice characterization of a bent-negabent Maiorana-McFarland function which is based on the permutation \(x \mapsto x^{2^i}\).

Keywords

negabent function Bent function quadratic Boolean function Maiorana-McFarland function permutation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Sumanta Sarkar
    • 1
  1. 1.Department of Computer ScienceUniversity of CalgaryCanada

Personalised recommendations