On weak and strong 2^k-bent Boolean functions

Pantelimon Stanica

Paper 2015/790

On weak and strong 2^k-bent Boolean functions

Pantelimon Stanica

Abstract

In this paper we introduce a sequence of discrete Fourier transforms and define new versions of bent functions, which we shall call (weak, strong) octa/hexa/2^k-bent functions. We investigate relationships between these classes and completely characterize the octabent and hexabent functions in terms of bent functions.

Metadata

Available format(s): PDF
Category: Foundations
Publication info: Preprint. MINOR revision.
Contact author(s): pstanica @ nps edu
History: 2015-08-10: received
Short URL: https://ia.cr/2015/790
License: CC BY

BibTeX

@misc{cryptoeprint:2015/790,
      author = {Pantelimon Stanica},
      title = {On weak and strong 2^k-bent Boolean functions},
      howpublished = {Cryptology ePrint Archive, Paper 2015/790},
      year = {2015},
      note = {\url{https://eprint.iacr.org/2015/790}},
      url = {https://eprint.iacr.org/2015/790}
}