Construction of Resilient Functions over a Finite Alphabet

Paul Camion 1 Anne Canteaut 1
1 CODES - Coding and cryptography
Inria Paris-Rocquencourt
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.
Type de document :
Rapport
[Research Report] RR-2789, INRIA. 1996
Liste complète des métadonnées

https://hal.inria.fr/inria-00073902
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 14:02:35
Dernière modification le : samedi 17 septembre 2016 - 01:27:27
Document(s) archivé(s) le : jeudi 24 mars 2011 - 13:16:52

Fichiers

Identifiants

  • HAL Id : inria-00073902, version 1

Collections

Citation

Paul Camion, Anne Canteaut. Construction of Resilient Functions over a Finite Alphabet. [Research Report] RR-2789, INRIA. 1996. 〈inria-00073902〉

Partager

Métriques

Consultations de la notice

87

Téléchargements de fichiers

126