Construction of t-Resilient Functions over a Finite Alphabet

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.

[1]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[2]  Serge Vaudenay.  La securite des primitives cryptographiques , 1995 .

[3]  Claude Carlet,et al.  On Correlation-Immune Functions , 1991, CRYPTO.

[4]  Ueli Maurer,et al.  Perfect Local Randomness in Pseudo-Random Sequences , 1989, CRYPTO.

[5]  Alfredo De Santis,et al.  Advances in Cryptology — EUROCRYPT'94 , 1994, Lecture Notes in Computer Science.

[6]  Serge Vaudenay,et al.  Black Box Cryptanalysis of Hash Networks Based on Multipermutations , 1994, EUROCRYPT.

[7]  Douglas R. Stinson,et al.  Bounds for Resilient Functions and Orthogonal Arrays , 1994, CRYPTO.

[8]  Thomas Siegenthaler,et al.  Correlation-immunity of nonlinear combining functions for cryptographic applications , 1984, IEEE Trans. Inf. Theory.

[9]  Oded Goldreich,et al.  The Bit Extraction Problem of t-Resilient Functions (Preliminary Version) , 1985, FOCS.

[10]  Douglas R. Stinson,et al.  Three characterizations of non-binary correlation-immune and resilient functions , 1995, Des. Codes Cryptogr..

[11]  James L. Massey,et al.  A spectral characterization of correlation-immune combining functions , 1988, IEEE Trans. Inf. Theory.

[12]  Joan Feigenbaum,et al.  Advances in Cryptology-Crypto 91 , 1992 .

[13]  Oded Goldreich,et al.  The bit extraction problem or t-resilient functions , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[14]  C. R. Rao,et al.  Factorial Experiments Derivable from Combinatorial Arrangements of Arrays , 1947 .

[15]  Yuliang Zheng,et al.  On Nonlinear Resilient Functions (Extended Abstract) , 1995, EUROCRYPT.

[16]  Serge Vaudenay,et al.  On the Need for Multipermutations: Cryptanalysis of MD4 and SAFER , 1994, FSE.

[17]  Gilles Brassard,et al.  Privacy Amplification by Public Discussion , 1988, SIAM J. Comput..