On the $q$-Bentness of Boolean Functions
Cryptography and Security
2017-11-09 v1
Abstract
For each non-constant in the set of -variable Boolean functions, the {\em -transform} of a Boolean function is related to the Hamming distances from to the functions obtainable from by nonsingular linear change of basis. Klapper conjectured that no Boolean function exists with its -transform coefficients equal to (such function is called -bent). In our early work, we only gave partial results to confirm this conjecture for small . 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 -bent functions, which are close to -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}
}