On the degree, nonlinearity, algebraic thickness, and nonnormality of Boolean functions, with developments on symmetric functions

IEEE Transactions on Information Theory

Volumn 50, Issue 9, 2004, Pages 2178-2185

  Carlet, Claude ^a,b  

^a INRIA   (France)

^b UNIVERSITÉ PARIS 8   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; FUNCTION EVALUATION; NONLINEAR SYSTEMS; SET THEORY; THEOREM PROVING;

ALGEBRAIC THICKNESSES; MONOMIALS; REED-MULLER CODE; SYMMETRIC FUNCTIONS;

CRYPTOGRAPHY;

EID: 4544343250     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2004.833361     Document Type: Article

References (33)

1. N. Alon and J. H. Spencer, The Probabilistic Method, 2nd ed. New York: Wiley-VCH, 2000.
2. A. Canteaut, C. Carlet, P. Charpin, and C. Fontaine, "On cryptographic properties of the cosets of R(1, m)," IEEE Trans. Inform. Theory, vol. 47, pp. 1494-1513, May 2001.
3. A. Canteaut, M. Daum, H. Dobbertin, and G. Leander, "Normal and non normal bent functions," in Proc. Workshop on Coding and Cryptography 2003, 2003, pp. 91-100.
4. A. Canteaut and M. Trabbia, "Improved fast correlation attacks using parity check equations of weight 4 and 5," in Advances in Cryptology - EUROCRYPT 2000 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 2000, vol. 1805, pp. 573-588.
5. C. Carlet, "Two new classes of bent functions," in Advances in Cryptology - EUROCRYPT'93 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1994, vol. 765, pp. 77-101.
6. C. Carlet, "On cryptographic complexity of boolean functions," in Proc. 6th Conf. Finite Fields With Applications to Coding Theory, Cryptography and Related Areas., G. L. Mullen, H. Stichtenoth, and H. Tapia-Recillas, Eds., Springer, 2002, pp. 53-69.
7. C. Carlet, "On the algebraic thickness and nonnormality of Boolean functions," in Proc. 2003 IEEE Information Theory Workshop, Paris, France, 2003, pp. 147-150.
8. P. Charpin, "Normal Boolean functions," J. Complexity (Complexity Issues in Coding and Cryptography). Issue dedicated to Prof. Harald Niederreiter on the occasion of his 60th birthday, to be published.
9. C. Ding, G.-Z. Xiao, and W. Shan, The stability Theory of Stream Ciphers (Lecture Notes on Computer Science). Berlin, Germany: Springer-Verlag, 1991, vol. 561.
10. H. Dobbertin, "Construction of bent functions and balanced boolean functions with high nonlinearity," in Fast Software Encryption: Proceedings of the 1994 Leuven Workshop on Cryptographic Algorithms (Lecture Notes in Computer Science) Berlin, Germany, 1995, vol. 1008, pp. 61-74.
11. S. Dubuc, "Etude des Propriétés de Dégérescence et de Normalité des Fonctions Booléennes et Construction de Fonctions q-aires parfaitement non linéaires," Ph.D. dissertation, University of Caen, Caen, France, 2001.
12. J. H. Evertse, "Linear structures in block ciphers, advances in cryptology," in Proc. EUROCRYPT' 87 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1988, vol. 304, , pp. 249-266.
13. L. R. Knudsen, "Truncated and higher order differentials," in Fast Software Encryption, Second International Workshop (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1995, vol. 1008, , pp. 196-211.
14. X. Lai, "Higher order derivatives and differential cryptanalysis," in Proc. Symp. Communication, Coding and Cryptography, R. E. Blahut, Ed. Norwell, MA: Kluwer, 1994, pp. 227-233.
15. O. B. Lupanov, "On circuits of functional elements with delay," Probl. Kibern., vol. 23, pp. 43-81, 1970.
16. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1977.
17. J. L. Massey, "Shift-register synthesis and BCH decoding," IEEE Trans. Inform. Theory, vol. IT-15, pp. 122-127, Jan. 1969.
18. M. Matsui, "Linear cryptanalysis method for DES cipher," in Advances in Cryptology - EUROCRYPT'93 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1994, vol. 765, pp. 386-397.
19. W. Meier and O. Staffelbach, "Nonlinearity criteria for cryptographic functions," in Advances in Cryptology, EUROCRYPT' 89 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1990, vol. 434, pp. 549-562.
20. A. Menezes, P. van Oorschot, and S. Vanstone, Handbook of Applied Cryptography. Boca Raton, FL: CRC, 1996, CRC Press Series on Discrete Mathematics and Its Applications.
21. S. Maitra and P. Sarkar, "Maximum nonlinearity of symmetric boolean functions on odd number of variables," IEEE Trans. Inform. Theory, vol. 48, pp. 2626-2630, Sept. 2002.
22. D. Olejár and M. Stanek, "On cryptographic properties of random boolean functions," J. Universal Comput. Sci., vol. 4, no. 8, pp. 705-717, 1998.
23. 15, 16] Reed-Muller code is at least 16276," IEEE Trans. Inform. Theory, vol. IT-29, pp. 354-356, May 1983.
24. 15, 16] Reed-Muller code is at least 16276," IEEE Trans. Inform. Theory, vol. 36, p. 443, Mar. 1990.
25. F. Rodier, "On the nonlinearity of boolean functions," J. Acta Arithmetica, to be published.
26. O. S. Rothaus, "On bent functions," J. Comb. Theory, vol. 20A, pp. 300-305, 1976.
27. R. A. Rueppel, "Analysis and design of stream ciphers," in Communication and Control Engineering Series Berlin, Heidelberg, London, Paris, Tokyo, 1986.
28. P. Savicky, "On the bent Boolean functions that are symmetric," Eur. J. Combin., vol. 15, pp. 407-410, 1994.
29. C. E. Shannon, "A mathematical theory of communication," Bell Syst. Tech. J., vol. 27, pp. 379-423, 1948.
30. C. E. Shannon, "Communication theory of secrecy systems," Bell Syst. Tech. J., vol. 28, pp. 656-715, 1949.
31. C. E. Shannon, "The synthesis of two-terminal switching circuits," Bell Syst. Tech. J., vol. 28, pp. 59-98, 1949.
32. I. Wegener, The Complexity of Boolean Functions. Stuttgart/New York: B.G. Teubner/Wiley, 1987.
33. Y. Zheng, X.-M. Zhang, and H. Imai, "Restriction, terms and nonlinearity of Boolean functions," Theor. Comput. Sci., vol. 226, no. 1-2, pp. 207-223, 1999.