Paper 2000/069 Original: eprint.iacr.org/2000/069 ↗
New constructions of resilient Boolean functions with maximal nonlinearity
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)
PDF- Category
- Secret-key cryptography
- Publication info
- Preprint.
- History
- 2000-12-29: last updated
- 2000-12-29: published
- Short URL
- https://ia.cr/2000/069
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2000/069,
author = {Yuriy Tarannikov},
title = {New constructions of resilient Boolean functions with maximal nonlinearity},
howpublished = {Cryptology {ePrint} Archive, Paper 2000/069},
year = {2000},
url = {https://eprint.iacr.org/2000/069}
}