On the q-Bentness of Boolean Functions

2017/11/08 by Chen, Zhixiong, Gu, Ting, Klapper, Andrew
#Cryptography and Security (cs.CR) #FOS: Computer and information sciences

paper · doi:10.48550/arxiv.1711.02917

Abstract

For each non-constant q in the set of n-variable Boolean functions, the \em q-transform of a Boolean function f is related to the Hamming distances from f to the functions obtainable from q by nonsingular linear change of basis. Klapper conjectured that no Boolean function exists with its q-transform coefficients equal to ± 2^n/2 (such function is called q-bent). In our early work, we only gave partial results to confirm this conjecture for small n. 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 q-bent functions, which are close to q-bentness.

Related

• On q-nearly bent Boolean functions
• Generalised Bent Criteria for Boolean Functions (I)
• A lower bound on the number of bent squares
• Several new classes of Boolean functions with few Walsh transform values
• Generalised Bent Criteria for Boolean Functions (II)