Construction of t-resilient functions over a finite alphabet

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1070, Issue , 1996, Pages 283-293

  Camion, Paul ^a   Canteaut, Anne ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; GROUP THEORY;

ABELIAN GROUP; CORRELATION IMMUNE FUNCTIONS; FINITE ALPHABET; ORTHOGONAL ARRAY; RANDOMIZERS; RESILIENT FUNCTION;

ORTHOGONAL FUNCTIONS;

EID: 84947913110     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68339-9_25     Document Type: Conference Paper

References (16)

1. C.H. Bennett, G. Brassard, and J.-M. Robert. Privacy amplification by public discussion.SIAM J. Computing, 17(2):210-229, april 1988.
2. J. Bierbrauer, K. Gopalakrishnan, and D.R. Stinson. Bounds for resilient functions and orthogonal arrays. In Y.G. Desmedt, editor,Advances in Cryptology-CRYPTO'94, number 839 in Lecture Notes in Computer Science, pages 247-256, 1994.
3. P. Camion, C. Carlet, P. Charpin, and N. Sendrier. On correlation-immune functions. In J. Feigenbaum, editor,Advances in Cryptology-CRYPTO'91, number 576 in Lecture Notes in Computer Science, pages 86-100. Springer-Verlag, 1992.
4. B. Chor, O. Goldreich, J. Hastad, J. Freidmann, S. Rudich, and R. Smolensky. The bit extraction problem or í: resilient functions. InProc. 26th IEEE Symposium on Foundations of Computer Science, pages 396-407, 1985.
5. P. Delsarte. An algebraic approach to the association schemes of coding theory. Thesis, Université catholique de Louvain, 1973.
6. K. Gopalakrishnan and D.R. Stinson. Three characterizations of non-binary correlation-immune and resilient functions.Designs,Codes and Cryptography, 5:241-251, 1995.
7. F.J. MacWilliams and N.J.A. Sloane. The Theory of Error-correcting Codes. North-Holland, 1983.
8. J.L. Massey. Some applications of coding theory in cryptography. InIMA Conference Proceedings on Cryptography and Coding IV, 1993.
9. U.M. Maurer and J.L. Massey. Perfect local randomness in pseudo-random sequences. In G. Brassard, editor,Advances in Cryptology - CRYPTO'89, number 435 in Lecture Notes in Computer Science, pages 100-112. Springer-Verlag, 1990.
10. C.R. Rao. Factorial experiments derivable from combinatorial arrangements of arrays.J. Roy. Statist., 9:128-139, 1947.
11. C.-P. Schnorr and S. Vaudenay. Black box cryptanalysis of hash networks based on multipermutations. In A. De Santis, editor,Advances in Cryptology - EU- ROCRYPT'94, number 950 in Lecture Notes in Computer Science, pages 47-57. Springer-Verlag, 1995.
12. T. Siegenthaler. Correlation-immunity of nonlinear combining functions for cryptographic applications.IEEE Trans. Inform. Theory, IT-30(5):776-780, 1984.
13. S. Vaudenay. On the need for multipermutations: cryptanalysis of MD4 and SAFER. InFast Software Encryption, Lecture Notes in Computer Science. Springer-Verlag, to appear.
14. S. Vaudenay.La sécurité des primitives cryptographiques. PhD thesis, Université Paris 7, 1995. in french.
15. G. Xiao and J.L. Massey. A spectral characterization of correlation-immune combining functions.IEEE Trans. Inform. Theory, IT-34(3):569-571, 1988.
16. X. Zhang and Y. Zheng. On nonlinear resilient functions. In L. Guillou and J.J. Quisquater, editors,Advances in Cryptology - EUROCRYPT'95, number 921 in Lecture Notes in Computer Science, pages 274-288. Springer-Verlag, 1995.