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 2n-1 - 2m+1 on nonlinearity of m-resilient n-variable Boolean functions is achieved for 0.6n - 1 ≤ m ≤ n - 2.
CITATION STYLE
Tarannikov, Y. (2002). New constructions of resilient boolean functions with maximal nonlinearity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2355, pp. 66–77). Springer Verlag. https://doi.org/10.1007/3-540-45473-X_6
Mendeley helps you to discover research relevant for your work.