Skip to main content
Top
Published in: Designs, Codes and Cryptography 1/2019

21-05-2018

On the q-bentness of Boolean functions

Authors: Zhixiong Chen, Ting Gu, Andrew Klapper

Published in: Designs, Codes and Cryptography | Issue 1/2019

Login to get access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

For each non-constant q in the set of n-variable Boolean functions, the 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 \(\pm \, 2^{n/2}\) (such function is called q-bent) when q is non-affine balanced. 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 for all n by investigating the nonexistence of the partial difference sets in abelian groups with special parameters. We also introduce a new family of functions called \((\delta ,q)\)-bent functions, which give a measurement of q-bentness.
Appendix
Available only for authorised users
Footnotes
1
If an \(h\in {\mathcal {B}}_n\), we say that the rank of h is the least positive integer r such that for some \(B\in GL_n\) the function \(h_B\) depends only on r variables.
 
2
In some papers G is a group with addition [3, 4], while in others G is a group with multiplication [911].
 
3
In this case, we use \(4\mu + 2^{n/2+1}\) in place of \(4\mu - 2^{n/2+1}\).
 
Literature
2.
go back to reference Cusick T., Stănică P.: Cryptographic Boolean Functions and Applications. Academic Press, Amsterdam (2009).MATH Cusick T., Stănică P.: Cryptographic Boolean Functions and Applications. Academic Press, Amsterdam (2009).MATH
3.
go back to reference Ding C.: Codes from Difference Sets. World Scientific, Singapore (2015). Ding C.: Codes from Difference Sets. World Scientific, Singapore (2015).
4.
go back to reference Ding C., Pott A., Wang Q.: Constructions of almost difference sets from finite fields. Des. Codes Cryptogr. 72(3), 581–592 (2014).MathSciNetCrossRefMATH Ding C., Pott A., Wang Q.: Constructions of almost difference sets from finite fields. Des. Codes Cryptogr. 72(3), 581–592 (2014).MathSciNetCrossRefMATH
6.
7.
8.
go back to reference Lidl R., Niederreiter H.: Finite Fields, 2nd edn. Cambridge University Press, Cambridge (1997).MATH Lidl R., Niederreiter H.: Finite Fields, 2nd edn. Cambridge University Press, Cambridge (1997).MATH
11.
Metadata
Title
On the q-bentness of Boolean functions
Authors
Zhixiong Chen
Ting Gu
Andrew Klapper
Publication date
21-05-2018
Publisher
Springer US
Published in
Designs, Codes and Cryptography / Issue 1/2019
Print ISSN: 0925-1022
Electronic ISSN: 1573-7586
DOI
https://doi.org/10.1007/s10623-018-0494-1

Other articles of this Issue 1/2019

Designs, Codes and Cryptography 1/2019 Go to the issue

Premium Partner