Construction of t-resilient functions over a finite alphabet

Authors:
Paul Camion;Anne Canteaut
Affiliations:
Centre National de la Recherche Scientifique;DRET and École Nationale Supérieure de Techniques Avancées, Paris
Venue:
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Year:
1996

Citing 7
Cited 6

Privacy amplification by public discussion

SIAM Journal on Computing - Special issue on cryptography
Three characterizations of non-binary correlation-immune and resilient functions

Designs, Codes and Cryptography
Perfect Local Randomness in Pseudo-Random Sequences

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
On Correlation-Immune Functions

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Bounds for Resilient Functions and Orthogonal Arrays

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
The bit extraction problem or t-resilient functions

SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
On nonlinear resilient functions

EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques

Codes, Bent Functions and Permutations Suitable For DES-likeCryptosystems

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

Designs, Codes and Cryptography
Covering Sequences of Boolean Functions and Their Cryptographic Significance

Designs, Codes and Cryptography
Correlation immunity and resiliency of symmetric Boolean functions

Theoretical Computer Science
Highly nonlinear mappings

Journal of Complexity - Special issue on coding and cryptography
More correlation-immune and resilient functions over Galois fields and Galois rings

EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques

Quantified Score

Hi-index	0.00

Visualization

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.