New Constructions of Resilient Boolean Functions with Maximal Nonlinearity

  • Authors:
  • Yuriy Tarannikov

  • Affiliations:
  • -

  • Venue:
  • FSE '01 Revised Papers from the 8th International Workshop on Fast Software Encryption
  • Year:
  • 2001

Quantified Score

Hi-index 0.12

Visualization

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.