Correlation-Immune and Resilient Functions Over a FiniteAlphabet and Their Applications in Cryptography

  • Authors:
  • Paul Camion;Anne Canteaut

  • Affiliations:
  • -;INRIA Projet Codes, Domaine de Voluceau, 78153 Le Chesnay Cedex, FRANCE

  • Venue:
  • Designs, Codes and Cryptography
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

We extend the notions of correlation-immunefunctions and resilient functions to functions over any finitealphabet. A previous result due to Gopalakrishnan and Stinsonis generalized as we give an orthogonal array characterization,a Fourier transform and a matrix characterization for correlation-immuneand resilient functions over any finite alphabet endowed withthe structure of an Abelian group. We then point out the existenceof a tradeoff between the degree of the algebraic normal formand the correlation-immunity order of any function defined ona finite field and we construct some infinite families of t-resilientfunctions with optimal nonlinearity which are particularly well-suitedfor combining linear feedback shift registers. We also pointout the link between correlation-immune functions and some cryptographicobjects as perfect local randomizers and multipermutations.