Conference ProceedingsOPEN ACCESS

New constructions of resilient boolean functions with maximal nonlinearity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2002) 2355 66-77
DOI: 10.1007/3-540-45473-X_6
24Citations
Citations of this article
34Readers
Mendeley users who have this article in their library.

This article is free to access.

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 2n-1 - 2m+1 on nonlinearity of m-resilient n-variable Boolean functions is achieved for 0.6n - 1 ≤ m ≤ n - 2.

Author supplied keywords

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free