English

On the $q$-Bentness of Boolean Functions

Cryptography and Security 2017-11-09 v1

Abstract

For each non-constant qq in the set of nn-variable Boolean functions, the {\em qq-transform} of a Boolean function ff is related to the Hamming distances from ff to the functions obtainable from qq by nonsingular linear change of basis. Klapper conjectured that no Boolean function exists with its qq-transform coefficients equal to ±2n/2\pm 2^{n/2} (such function is called qq-bent). In our early work, we only gave partial results to confirm this conjecture for small nn. Here we prove thoroughly that the conjecture is true by investigating the nonexistence of the partial difference sets in Abelian groups with special parameters. We also introduce a new family of functions called almost qq-bent functions, which are close to qq-bentness.

Keywords

Cite

@article{arxiv.1711.02917,
  title  = {On the $q$-Bentness of Boolean Functions},
  author = {Zhixiong Chen and Ting Gu and Andrew Klapper},
  journal= {arXiv preprint arXiv:1711.02917},
  year   = {2017}
}
R2 v1 2026-06-22T22:39:52.768Z