English

Generalized Maiorana-McFarland Constructions for Almost Optimal Resilient Functions

Cryptography and Security 2010-03-19 v1 Information Theory Combinatorics math.IT

Abstract

In a recent paper \cite{Zhang-Xiao}, Zhang and Xiao describe a technique on constructing almost optimal resilient functions on even number of variables. In this paper, we will present an extensive study of the constructions of almost optimal resilient functions by using the generalized Maiorana-McFarland (GMM) construction technique. It is shown that for any given mm, it is possible to construct infinitely many nn-variable (nn even), mm-resilient Boolean functions with nonlinearity equal to 2n12n/212k12^{n-1}-2^{n/2-1}-2^{k-1} where k<n/2k<n/2. A generalized version of GMM construction is further described to obtain almost optimal resilient functions with higher nonlinearity. We then modify the GMM construction slightly to make the constructed functions satisfying strict avalanche criterion (SAC). Furthermore we can obtain infinitely many new resilient functions with nonlinearity >2n22(n1)/2>2^{n-2}-2^{(n-1)/2} (nn odd) by using Patterson-Wiedemann functions or Kavut-Yu¨\ddot{u}cel functions. Finally, we provide a GMM construction technique for multiple-output almost optimal mm-resilient functions F:F2nF2rF: \mathbb{F}_2^n\mapsto \mathbb{F}_2^r (nn even) with nonlinearity >2n12n/2>2^{n-1}-2^{n/2}. Using the methods proposed in this paper, a large class of previously unknown cryptographic resilient functions are obtained.

Cite

@article{arxiv.1003.3492,
  title  = {Generalized Maiorana-McFarland Constructions for Almost Optimal Resilient Functions},
  author = {WeiGuo Zhang and GuoZhen Xiao},
  journal= {arXiv preprint arXiv:1003.3492},
  year   = {2010}
}

Comments

18 pages

R2 v1 2026-06-21T14:59:13.154Z