On the linear structures of balanced functions and quadratic APN functions

The set of linear structures of most known balanced Boolean functions is non-trivial. In this paper, some balanced Boolean functions whose set of linear structures is trivial are constructed. We show that any APN function in even dimension must have a component whose set of linear structures is trivial. We determine a general form for the number of bent components in quadratic APN functions in even dimension and some bounds on the number are produced. We also count bent components in any quadratic power functions.

[1]  Thomas W. Cusick,et al.  Counting Balanced Boolean Functions in n Variables with Bounded Degree , 2007, Exp. Math..

[2]  Tsutomu Matsumoto,et al.  Advances in Cryptology — ASIACRYPT'94 , 1994, Lecture Notes in Computer Science.

[3]  Yongqiang Li,et al.  A matrix approach for constructing quadratic APN functions , 2014, Des. Codes Cryptogr..

[4]  Bart Preneel,et al.  Classification of cubic (n-4)-resilient Boolean functions , 2006, IEEE Transactions on Information Theory.

[5]  Kwangjo Kim,et al.  Semi-bent Functions , 1994, ASIACRYPT.

[6]  Sihem Mesnager,et al.  Further study on the maximum number of bent components of vectorial functions , 2018, Des. Codes Cryptogr..

[7]  Claude Carlet,et al.  Vectorial Boolean Functions for Cryptography , 2006 .

[8]  Enes Pasalic,et al.  On the Maximum Number of Bent Components of Vectorial Functions , 2018, IEEE Transactions on Information Theory.

[9]  Jennifer Seberry,et al.  Nonlinearly Balanced Boolean Functions and Their Propagation Characteristics (Extended Abstract) , 1993, CRYPTO.

[10]  Guang Gong,et al.  New Construction for Balanced Boolean Functions with Very High Nonlinearity , 2007, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[11]  Gregor Leander,et al.  Monomial bent functions , 2006, IEEE Transactions on Information Theory.

[12]  Thomas W. Cusick.  Affine equivalence of cubic homogeneous rotation symmetric functions , 2011, Inf. Sci..

[13]  Claude Carlet,et al.  Boolean Functions for Cryptography and Error-Correcting Codes , 2010, Boolean Models and Methods.

[14]  Thierry P. Berger,et al.  On Almost Perfect Nonlinear Functions Over$mmb F_2^n$ , 2006, IEEE Transactions on Information Theory.

[15]  Kaisa Nyberg,et al.  Perfect Nonlinear S-Boxes , 1991, EUROCRYPT.

[16]  Tor Helleseth,et al.  Some Results on the Known Classes of Quadratic APN Functions , 2016, IACR Cryptol. ePrint Arch..

[17]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[19]  Cong Ling,et al.  On the Geometric Ergodicity of Metropolis-Hastings Algorithms for Lattice Gaussian Sampling , 2015, IEEE Transactions on Information Theory.

[20]  Massimiliano Sala,et al.  A note on APN permutations in even dimension , 2015, Finite Fields Their Appl..

[21]  Tsutomu Matsumoto,et al.  Incidence structures for key sharing , 1995 .

[22]  A. Meyer,et al.  Introduction to Number Theory , 2005 .

[23]  Dengguo Feng,et al.  Boolean Functions and Their Applications in Cryptography , 2016, Advances in Computer Science and Technology.