More correlation-immune and resilient functions over galois fields and galois rings

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

Volumn 1233, Issue , 1997, Pages 422-433

  Carlet, Claude ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BENT FUNCTION; GALOIS FIELDS; GALOIS RING; RESILIENT FUNCTION;

CRYPTOGRAPHY;

EID: 84957358188     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-69053-0_29     Document Type: Conference Paper

References (22)

1. A.S. Ambrosimov. Properties of bent functions of q-valued logic over finite fields. Discrete Math. Appl. vol. 4, No. 4, pages 341-350 (1994)
2. J. Bierbrauer, K. Gopalakrishnan and D.R. Stinson. Bounds for resilient functions and orthogonal arrays. Advances in Cryptology, CRYPTO’94, Lecture Notes in Computer Sciences, Springer Verlag no. 839, pages 247-256 (1994)
3. P. Camion and A. Canteaut. Construction of t-resilient functions over a finite alphabet, Advances in Cryptology, EUROCRYPT’96, Lecture Notes in Computer Sciences, Springer Verlag no. 1070, pages 283-293 (1996)
4. P. Camion and A. Canteaut. Generalization of Siegenthaler inequality and Schnorr-Vaudenay multipermutations. In N. Koblitz, editor, Advances in Cryptology-CRYPTO’96, number 1109 in Lecture Notes in Computer Science, pages 372-386 Springer-Verlag, 1996.
5. P. Camion, C. Carlet, P. Charpin and N. Sendrier. On correlation-immune functions. Advances in Cryptology, CRYPTO’91, Lecture Notes in Computer Sciences, Springer Verlag no. 576, pages 86-100 (1992)
6. C. Carlet. Two new classes of bent functions. EUROCRYPT’ 93, Advances in Cryptology, Lecture Notes in Computer Science 765, pages 77-101 (1994)
7. C. Carlet, Generalized Partial Spreads, IEEE Transactions on Information Theory vol. 41 pages 1482-1487 (1995)
8. C. Carlet. A construction of bent functions. Finite Fields and Applications, London Mathematical Society, Lecture Series 233, Cambridge University Press, pages 47-58 (1996)
9. C. Carlet and P. Guillot. A characterization of binary bent functions. Journal of Combinatorial Theory, Series A, Vol. 76, No. 2 pages 328-335 (1996)
10. C. Carlet. Hyperbent functions. PRAGOCRYPT’97, Czech Technical University Publishing House, pages 145-155 (1996).
11. J. F. Dillon. Elementary Hadamard Difference sets. Ph. D. Thesis, Univ. of Maryland (1974).
12. 4-linearity of Kerdock, Preparata, Goethals and related codes. IEEE Transactions on Information Theory, vol. 40, pages 301-320, (1994)
13. P. V. Kumar, R.A. Scholtz and L.R. Welch. Generalized bent functions and their properties. Journal of Combinatorial Theory, Series A 40, pages 90-107 (1985)
14. B.R. MacDonald. Finite rings with identity. Marcel Dekker, NY, 1974
15. W. Meier and O. Staffelbach. Nonlinearity Criteria for Cryptographic Functions. Advances in Cryptology, EUROCRYPT’ 89, Lecture Notes in Computer Science 434, pages 549-562, Springer Verlag (1990)
16. K. Nyberg. Perfect non-linear S-boxes. Advances in Cryptology, EUROCRYPT’ 91, Lecture Notes in Computer Science 547, pages 378-386, Springer Verlag (1992)
17. O. S. Rothaus. On bent functions. J. Comb. Theory, 20A, pages 300-305(1976)
18. P. Samuel. Algebraic Theory of Numbers. Boston, Houghton Mifflin, 1970
19. C. E. Shannon. Communication theory of secrecy systems, in Bell system technical journal, vol. 28, pages 656-715 (1949)
20. T. Siegenthaler. Correlation-Immunity of Nonlinear Combining Functions for Cryptographic Applications. IEEE Trans, on Inf. Theory, vol. IT-30, no 5, pages 776-780 (1984)
21. C.P. Schnorr and S. Vaudenay. Black box cryptanalysis of hash networks based on multipermutations. Advances in Cryptology, EUROCRYPT’ 94, Lecture Notes in Computer Science 950, pages 47-57, Springer Verlag (1995)
22. Xiao Guo-Zhen and J. L. Massey. A Spectral Characterization of Correlation-Immune Combining Functions. IEEE Trans. Inf. Theory, vol. IT-34, no 3, pages 569-571 (1988)