A new construction of highly nonlinear S-boxes

Authors:
Peter Beelen;Gregor Leander
Affiliations:
DTU Mathematics, Technical University Denmark, Lyngby, Denmark;DTU Mathematics, Technical University Denmark, Lyngby, Denmark
Venue:
Cryptography and Communications
Year:
2012

Citing 7
Cited 0

The MAGMA algebra system I: the user language

Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference
Codes, Bent Functions and Permutations Suitable For DES-likeCryptosystems

Designs, Codes and Cryptography
Upper and Lower Bounds on Maximum Nonlinearity ofn-input m-output Boolean Function

Designs, Codes and Cryptography
Perfect nonlinear S-boxes

EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
On the construction of highly nonlinear permutations

EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
New families of quadratic almost perfect nonlinear trinomials and multinomials

Finite Fields and Their Applications
Nonlinearities of S-boxes

Finite Fields and Their Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.