Construction of Resilient Functions over a Finite Alphabet - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 1996

Construction of Resilient Functions over a Finite Alphabet

Anne Canteaut

Abstract

We extend the notions of correlation-immune functions and resilient functions to functions over any finite alphabet endowed with the structure of an Abelian group. Thus we generalize the results of Gopalakrishnan and Stinson as we give an orthogonal array characterization and a Fourier transform characterization for resilient functions over any finite alphabet. This leads to a generalization of some related cryptographic objects as perfect local randomizers. It also enables us to construct new resilient functions by composition of resilient functions of smaller order.
Fichier principal
Vignette du fichier
RR-2789.pdf (258.79 Ko) Télécharger le fichier

Dates and versions

inria-00073902 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00073902 , version 1

Cite

Paul Camion, Anne Canteaut. Construction of Resilient Functions over a Finite Alphabet. [Research Report] RR-2789, INRIA. 1996. ⟨inria-00073902⟩
45 View
91 Download

Share

Gmail Facebook Twitter LinkedIn More