On the propagation criterion of degree l and order k

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

Volumn 1403, Issue , 1998, Pages 462-474

  Carlet, Claude ^a,b  

^a UNIVERSITÉ DE CAEN   (France)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS;

NON LINEAR; NONLINEAR MAPPINGS; PROPAGATION CRITERION;

CRYPTOGRAPHY;

EID: 84957632021     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0054146     Document Type: Conference Paper

References (24)

1. 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 n° 839, pages 247-256 (1994)
2. A.E. Brouwer and L.M.G.M. Tholhuizen. A sharpening of the Johnson bound for binary linear codes and the nonexistence of linear codes with Preparata parameters Designs, Codes and Cryptogruphy 3, pages 95-98 (1993)
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 n° 1070, pages 283-293 (1996)
4. P. Camion and A. Canteaut. Generalization of Siegenthaler inequality and Schnorr-Vaudenay inultipeπnutations. In N. Koblitz, editor, Advances in Cryptology - CRYPTO’96, number 1109 in Lecture Notes in Computer Science, pages 372-386 Springer-Verlag, 1990.
5. P. Camion, C. Carlet, P. Chaipinanil, N. Sendrier. On correlation-immune functions. Advances in Cryptology, CRYPTO’91, Lecture Notes in Computer Sciences, Springer Verlag n° 576, pages 86-100 (1992)
6. C. Carlet. Hyperbent functions. PRAGOCRYPT’96, Czech Technical University Publishing House, pages 145-155 (1996).
7. C. Carlet. More correlation-immune and resilient functions over Galois fields and Galois rings. Advances in Cryptology, EUROCRYPT' 97, Lecture Notes in Computer Science 1233, pages 422-433, Springer Verlag (1997)
8. P. Delsarte. An algebraic approach to the association schemes of coding theory. Thesis, Université Catholique de Louvain (1973).
9. P. Delsarte. Four fundamental parameters of a code and their combinatorial significance. Information and Control, vol 23, n° 5, pages 407-438 (1973).
10. J. F. Dillon. Elementary Hadamard Difference sets. Ph. D. Thesis, Univ. of Maryland (1974).
11. 4-linearity of Kerdock, Preparata, Goethals and related codes. IEEE Transactions on Information Theory, vol 40, pages 301-320, (1994)
12. F.B. Hergert. On the Delsarte-Goethals codes and their formal duals. Discrete Math. 83, pages 249-263 (1990)
13. S. Hirose and K. Ikeda. Nonlinearity criteria of Boolean functions. KUIS Technical Report, KUIS-94-0002 (1994); postcript file on the web page: http://www.labl.kuis.kyoto-u.ac.jp/members/hirose/publications-e.html
14. S. Hirose and K. Ikeda. Complexity of Boolean functions satisfying the propagation criterion. The Proc. of the 1995 Symposium on Cryptography and Information Security, SCIS95-B3.3, (1995).
15. T. Jakobsen and L.R. Knudsen. The interpolation attack on block ciphers. Preproc. of Fast Software Encryption, pages 28-40 (1997).
16. K. Kurosawa and T. Satoh. Design of SAC/PC(ℓ) of order k Boolean functions and three other cryptographic criteria. Advances in Cryptology, EUROCRYPT’ 97, Lecture Notes in Computer Science 1233, pages 434-449, Springer Verlag (1997)
17. 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)
18. B. Preneel, W. Van Leekwijck, L. Van Linden, R. Govaerts and J. Vandevalle. Propagation characteristics of Boolean functions, Advances in Cryptology, EURO-CRYPT’90, Lecture Notes in Computer Sciences, Springer Verlag n° 473, pages 161-173 (1991)
19. B. Preneel, R. Govaerts and J. Vandevalle. Boolean functions satisfying higher order propagation criteria, Advances in Cryptology, EUROCRYPT’91, Lecture Notes in Computer Sciences, Springer Verlag n° 547, pages 141-152 (1991)
20. O. S. Rothaus. On bent functions. J. Comb. Theory, 20A, pages 300-305(1976)
21. F. J. MacWilliams et N. J. Sloane, The theory of error-correcting codes, Amsterdam, North Holland 1977.
22. D.R. Stinson. Resilient functions and large sets of orthogonal arrays. Congressus Nurner., vol 92, pages 105-110 (1993)
23. D.R. Stinson and J.L. Massey. An infinite class of counterexamples to a conjecture concerning nonlinear resilient functions. Journal of Cryptology, vol 8, n° 3, pages 167-173 (1995)
24. A. Webster and S. Tavares. On the design of S-boxes. Advances in Cryptology, CRYPTO’85, Lecture Notes in Computer Science n° 218, pages 523-534 (1985)