Skip to main content

Characterizing Negabent Boolean Functions over Finite Fields

  • Conference paper
Book cover Sequences and Their Applications – SETA 2012 (SETA 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7280))

Included in the following conference series:

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}\).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dillon, J.: Elementary Hadamard Difference sets, Ph.D. dissertation, Univ. of Maryland (1974)

    Google Scholar 

  2. Dobbertin, H., Leander, G.: A Survey of Some Recent Results on Bent Functions. In: Helleseth, T., Sarwate, D., Song, H.-Y., Yang, K. (eds.) SETA 2004. LNCS, vol. 3486, pp. 1–29. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  3. Helleseth, T., Kholosha, A.: \(x^{2^l+1} + x + a\) and related affine polynomials over GF(2k). Cryptography and Communications 2(1), 85–109 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  4. Parker, M.G.: Constabent properties of Golay-Davis-Jedwab sequences. In: Int. Symp. Information Theory, p. 302. IEEE, Sorrento (2000)

    Google Scholar 

  5. Parker, M.G., Pott, A.: On Boolean Functions Which are Bent and Negabent. In: Golomb, S.W., Gong, G., Helleseth, T., Song, H.-Y. (eds.) SSC 2007. LNCS, vol. 4893, pp. 9–23. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  6. Riera, C., Parker, M.G.: One and Two-Variable Interlace Polynomials: A Spectral Interpretation. In: Ytrehus, Ø. (ed.) WCC 2005. LNCS, vol. 3969, pp. 397–411. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  7. Rothaus, O.S.: On bent functions. Journal of Combinatorial Theory Series A 20, 300–305 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  8. Sarkar, S.: On the Symmetric Negabent Boolean Functions. In: Roy, B., Sendrier, N. (eds.) INDOCRYPT 2009. LNCS, vol. 5922, pp. 136–143. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  9. Schmidt, K.-U., Parker, M.G., Pott, A.: Negabent Functions in the Maiorana–McFarland Class. In: Golomb, S.W., Parker, M.G., Pott, A., Winterhof, A. (eds.) SETA 2008. LNCS, vol. 5203, pp. 390–402. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  10. Stănică, P., Gangopadhyay, S., Chaturvedi, A., Gangopadhyay, A.K., Maitra, S.: Nega–Hadamard Transform, Bent and Negabent Functions. In: Carlet, C., Pott, A. (eds.) SETA 2010. LNCS, vol. 6338, pp. 359–372. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

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. https://doi.org/10.1007/978-3-642-30615-0_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30615-0_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30614-3

  • Online ISBN: 978-3-642-30615-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics