CryptoDB

Paper: New constructions of resilient Boolean functions with maximal nonlinearity

Authors: Yuriy Tarannikov URL: http://eprint.iacr.org/2000/069 Search ePrint Search Google 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$.
BibTeX
@misc{eprint-2000-11413,
title={New constructions of resilient Boolean functions with maximal nonlinearity},
booktitle={IACR Eprint archive},
keywords={secret-key cryptography / stream cipher, Boolean function, nonlinear combining function, correlation-immunity, resiliency, nonlinearity},
url={http://eprint.iacr.org/2000/069},
note={ yutaran@mech.math.msu.su 11320 received 29 Dec 2000},
author={Yuriy Tarannikov},
year=2000
}