A new construction of highly nonlinear S-boxes

Publication: Research - peer-reviewJournal article – Annual report year: 2012

Standard

A new construction of highly nonlinear S-boxes. / Beelen, Peter; Leander, Gregor.

In: Cryptography and Communications, Vol. 4, No. 1, 2012, p. 65-77.

Publication: Research - peer-reviewJournal article – Annual report year: 2012

Harvard

APA

CBE

MLA

Vancouver

Author

Beelen, Peter; Leander, Gregor / A new construction of highly nonlinear S-boxes.

In: Cryptography and Communications, Vol. 4, No. 1, 2012, p. 65-77.

Publication: Research - peer-reviewJournal article – Annual report year: 2012

Bibtex

@article{41b8fe3d62d84a5b86bfda8eba759ae0,
title = "A new construction of highly nonlinear S-boxes",
keywords = "Concatenation, Reed–Muller codes, Linear codes, Boolean functions, Nonlinearity",
publisher = "Springer",
author = "Peter Beelen and Gregor Leander",
year = "2012",
doi = "10.1007/s12095-011-0052-4",
volume = "4",
number = "1",
pages = "65--77",
journal = "Cryptography and Communications",
issn = "19362447",

}

RIS

TY - JOUR

T1 - A new construction of highly nonlinear S-boxes

A1 - Beelen,Peter

A1 - Leander,Gregor

AU - Beelen,Peter

AU - Leander,Gregor

PB - Springer

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

KW - Concatenation

KW - Reed–Muller codes

KW - Linear codes

KW - Boolean functions

KW - Nonlinearity

U2 - 10.1007/s12095-011-0052-4

DO - 10.1007/s12095-011-0052-4

JO - Cryptography and Communications

JF - Cryptography and Communications

SN - 19362447

IS - 1

VL - 4

SP - 65

EP - 77

ER -