You are looking at a specific version 20001229:165312 of this paper. See the latest version.

Paper 2000/069

New constructions of resilient Boolean functions with maximal nonlinearity

Yuriy Tarannikov

Abstract

In this paper we develop a technique that allows to obtain new effective constructions of highly resilient Boolean functions with high nonlinearity. In particular, we prove that the upper bound $2^{n-1}-2^{m+1}$ on nonlinearity of m-resilient n-variable Boolean functions is achieved for $0.6n-1\le m\le n-2$.

Metadata
Available format(s)
PS
Category
Secret-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
stream cipherBoolean functionnonlinear combining functioncorrelation-immunityresiliencynonlinearity
Contact author(s)
yutaran @ mech math msu su
History
2000-12-29: received
Short URL
https://ia.cr/2000/069
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.