A new construction of highly nonlinear S-boxes

In this paper we give a new construction of highly nonlinear vectorial Boolean functions. This construction is based on coding theory, more precisely we use concatenation to construct Boolean functions from codes over $\mathbb{F}_q$ containing a first-order generalized Reed–Muller code. As it turns out this construction has a very compact description in terms of Boolean functions, which is of independent interest. The construction allows one to design functions with better nonlinearities than known before.

[1]  Kaisa Nyberg,et al.  On the Construction of Highly Nonlinear Permutations , 1992, EUROCRYPT.

[2]  Claude Carlet,et al.  Codes, Bent Functions and Permutations Suitable For DES-like Cryptosystems , 1998, Des. Codes Cryptogr..

[3]  John J. Cannon,et al.  The Magma Algebra System I: The User Language , 1997, J. Symb. Comput..

[4]  Masao Kasahara,et al.  Upper and Lower Bounds on Maximum Nonlinearity of n-input m-output Boolean Function , 2001, Des. Codes Cryptogr..

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

[6]  Eimear Byrne,et al.  New families of quadratic almost perfect nonlinear trinomials and multinomials , 2008, Finite Fields Their Appl..

[7]  Cunsheng Ding,et al.  Nonlinearities of S-boxes , 2007, Finite Fields Their Appl..

[8]  Gregor Leander,et al.  Reconstruction of Highly Non Linear Sboxes from Linear Codes , 2009, Enhancing Cryptographic Primitives with Techniques from Error Correcting Codes.

[9]  T. Kasami.  WEIGHT DISTRIBUTION OF BOSE-CHAUDHURI-HOCQUENGHEM CODES. , 1966 .