Sur la non-linéarité des fonctions booléennes

Acta Arithmetica

Volumn 115, Issue 1, 2004, Pages 1-22

  Rodier, François ^a,b  

^a Inst de Mathematiques de Luminy ^*

^b AIX MARSEILLE UNIVERSITÉ   (France)

Author keywords

Boolean function; Covering radius; Cryptography; Error correcting code; Fourier transform; Non linearity; Random polynomial

Indexed keywords

EID: 18444411945     PISSN: 00651036     EISSN: None     Source Type: Journal    
DOI: 10.4064/aa115-1-1     Document Type: Article

References (29)

1. C. Adams and S. Mister, Practical S-box design, preprint, http://adonis.ee.queensu.ca:8000/cast/psbd.ps.
2. N. Bourbaki, Eléments de mathématiques, Algèbre I, chap. 1 à 3, Hermann, Paris, 1970.
3. _, Eléments de mathématiques, Théorie spectrale, chap. 1 et 2, Hermann, Paris, 1967.
4. F. Bruhat, Distributions sur un groupe localement compact et applications à l'étude des représentations des groupes p-adiques, Bull. Soc. Math. France 89 (1961), 43-75.
5. J. Bucklew, Large deviation techniques in decision, simulation, and estimation, Wiley Ser. Probab. Math. Statist. Appl. Probab. Statist., John Wiley & Sons, New York, 1990.
6. A. Canteaut, C. Carlet, P. Charpin and C. Fontaine, Propagation characteristics and correlation-immunity of highly nonlinear Boolean functions, dans: Advances in Cryptology-EUROCRYPT 2000 (Bruges), Lecture Notes in Comput. Sci. 1807, Springer, Berlin, 2000, 507-522.
7. C. Carlet, On cryptographic complexity of Boolean functions, dans: Proc. Sixth Conf. on Finite Fields with Applications to Coding Theory, Cryptography and Related Areas, G. L. Mullen, H. Stichtenoth and H. Tapia-Recillas (eds.), Springer, Berlin, 2002, 53-69.
8. _, On the algebraic thickness and non-normality of Boolean functions, dans: Proc. "2003 IEEE Information Theory Workshop", Paris, 2003, 147-150.
9. C. Carlet and P. Guillot, A characterization of binary bent functions, J. Combin. Theory Ser. A 76 (1996), 328-335.
10. C. Carlet and A. Klapper, Upper bounds on the numbers of resilient functions and of bent functions, Lecture Notes dédiées à Philippe Delsarte, Springer, à paraître; une version abrégée est paru dans les Proceedings of the 23rd Symposium on Information Theory in the Benelux, Louvain-La-Neuve, 2002.
11. F. Chabaud and S. Vaudenay, Links between differential and linear cryptanalysis, dans: Advances in Cryptology-EUROCRYPT 1994 (Perugia), Lecture Notes in Comput. Sci. 950, Springer, Berlin, 1995, 356-365.
12. A. Dembo and O. Zeitouni, Large Deviations Techniques and Applications, Appl. Math. (New York) 38, Springer, New York, 1998.
13. J. Dillon, Elementary Hadamard difference sets, thèse de doctorat, Univ. of Maryland, 1974.
14. T. Erdélyi, Polynomials with Littlewood-type coefficient constraints, dans: Approximation Theory X, C. K. Chui, L. L. Schumaker and J. Stöckler (eds.), Vanderbilt Univ. Press, Nashville, TN, 2002, 153-196.
15. P. Erdös, Some unsolved problems, Michigan Math. J. 4 (1957), 291-300.
16. C. Fontaine, Contribution a ̀ la recherche de fonctions booléennes hautement non linéaires et au marquage d'images en vue de la protection des droits d'auteur, thèse, Univ. Paris VI, 1998; http://www-rocq.inria.fr/codes/Caroline.Fontaine/THESE/these.html.
17. J.-P. Kahane, Some Random Series of Functions, 2nd ed., Cambridge Stud. Adv. Math. 5, Cambridge Univ. Press, Cambridge, 1985.
18. B. Kashin and L. Tsafriri [L. Tzafriri], A lower bound for the maximum of a random process, Math. Notes 56 (1994), 1306-1308.
19. P. Langevin, Les sommes de caractères et la formule de Poisson dans la théorie des codes, des séquences et des fonctions booléennes, Habilitation à Diriger les Recherches, Univ. de Toulon et du Var, 1999; http://www.univ-tln.fr/~langevin/.
20. P. Langevin and P. Solé, Kernels and defaults, dans: Finite Fields: Theory, Applications and Algorithms, G. L. Mullen and R. C. Mullin (eds.), Contemp. Math. 225, Amer. Math. Soc., Providence, RI, 1999, 77-85.
21. θi, J. London Math. Soc. 41 (1966), 367-376.
22. W. Meier and O. Staffelbach, Nonlinearity criteria for cryptographic functions, dans: Advances in Cryptology - EUROCRYPT '89 (Houthalen), Lecture Notes in Comput. Sci. 434, Springer, Berlin, 1990, 549-562.
23. 4 norm of a polynomial with coefficients ±1, Amer. Math. Monthly 97 (1990), 42-45.
24. K. Nyberg, Perfect nonlinear S-boxes, dans: Advances in Cryptology - EUROCRYPT '91 (Brighton), Lecture Notes in Comput. Sci. 547, Springer, Berlin, 1991, 378-386.
25. D. Olejár and M. Stanek, On cryptographic properties of random Boolean functions, J. Universal Comput. Sci. 4 (1998), 705-717.
26. 15, 16) Reed-Muller code is at least 16276, IEEE Trans. Inform. Theory 29 (1983), 354-356.
27. R. Salem and A. Zygmund, Some properties of trigonometric series whose terms have random signs, Acta Math. 91 (1954), 245-301.
28. P. Stǎnicǎ, Nonlinearity, local and global avalanche characteristics of balanced Boolean functions, Discrete Math. 248 (2002), 181-193.
29. X. M. Zhang and Y. L. Zheng, GAC - the criterion for global avalanche characteristics of cryptographic functions, J. Universal Comput. Sci. 1 (1995), 320-337.