On the algebraic thickness and non-normality of Boolean functions

Proceedings - 2003 IEEE Information Theory Workshop, ITW 2003

Volumn , Issue , 2003, Pages 147-150

  Carlet, C ^a,b  

^a INRIA   (France)

^b Centre National de la Recherche Scientifique   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; CRYPTOGRAPHY; INFORMATION THEORY;

ALGEBRAIC DEGREES; CRYPTOGRAPHIC BOOLEAN FUNCTIONS; HIGH NONLINEARITY; NEW RESULTS; NON-NORMALITY; SHANNON; SYMMETRIC FUNCTIONS;

ALGEBRA;

EID: 4544361342     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITW.2003.1216716     Document Type: Conference Paper

References (26)

1. N. Alon, J.H. Spencer. The probabilistic method. Wiley-VCH 2000 (second edition).
2. A. Canteaut, C. Carlet, P. Charpin and C. Fontaine, " On cryptographic properties of the cosets of R(1, m)," IEEE Transactions on Information Theory Vol. 47, no 4, pp. 1494-1513 (2001)
3. A. Canteaut and M. Trabbia, " Improved fast correlation attacks using parity check equations of weight 4 and 5, " Advances in Cryptology-EUROCRYPT2000, number 1805 in Lecture Notes in Computer Science, pp. 573-588. Springer-Verlag, 2000.
4. C. Carlet, " Two new classes of bent functions, " Advances in Cryptology-EUROCRYPT'93, number 765 in Lecture Notes in Computer Science, pp. 77-101. Springer-Verlag, 1994.
5. C. Carlet, " On cryptographic complexity of Boolean, " Proceedings of the Sixth Conference on Finite Fields with Applications to Coding Theory, Cryptography and Related Areas, Springer, G.L. Mullen, H. Stichtenoth and H. Tapia-Recillas Eds, pp. 53-69,2002.
6. C. Carlet, "On the degree, nonlinearity, algebraic thickness and nonnormality of Boolean functions, with developments on symmetric functions," Submitted to IEEE Transactions on Information Theory, 2003.
7. H. Dobbertin, " Construction of bent functions and balanced Boolean functions with high nonlinearity, " Fast Software Encryption (Pmceedings of the 1994 Leuven Workshop on Cryptographic Algorithms), Lecture Notes in Computer Science 1008, Springer Verlag, pp. 61-74, 1995.
8. S. Dubuc, " Etude des propri6t6s de dt5g6rescence et de normalit6 des fonctions bool&nnes et construction de fonctions q-aires parfaitement non linCaires, " PhD thesis, University of Caen, 2001.
9. J. H. Evertse, " Linear structures in block ciphers," Advances in Cryptobgy, EUROCRYPT' 87, Lecture Notes in Computer Science 304, pp. 249-266, Springer Verlag, 1988.
10. L.R. Knudsen, " Truncated and higher order differentials, " Fast Software Encryption. Second International Workshop, Lecture Notes in Computer Science, n 1008. pp. 196-211.-Springer-Verlag, 1995.
11. X. Lai, " Higher order derivatives and differential cryptanalysis, " Pmc. "Symposium on Communication, Coding and Cryptography, in honor of J. L. Massey on the occasion of his 60% birthday. 1994.
12. O.B. Lupanov, " On circuits of functional elements with delay, " Pmbl. Kibern. 23, pp. 43-81 (1970).
13. F.J. MacWilliams and N.J.A. Sloane. The theory of error-correcting codes. North-Holland, 1977.
14. J.L. Massey, " Shift-register synthesis and BCH decoding, " ZEEE Transactions on Information Theory, vol. 15, pp. 122-127, 1969.
15. M. Matsui, " Linear cryptanalysis method for DES cipher, " Advances in Cryptology-EUROCRYPT'93, number 765 in Lecture Notes in Computer Science. Springer-Verlag, 1994.
16. W. Meier and 0. Staffelbach, " Nonlinearity Criteria for Cryptographic Functions," Advances in Cryptology, EUROCRYPT' 89, Lecture Notes in Computer Science 434, pp. 549-562, Springer Verlag (1990)
17. A. Menezes, P. van Oorschot, and S. Vanstone, Handbook of Applied Cryptography. CRC Press Series on Discrete Mathematics and Its Applications, 1996.
18. S. Maitra and P. Sarkar, " Maximum nonlinearity of symmetric Boolean functions on odd number of variables, " IEEE Transactions on Infomtion Theory, vol. 48, pp. 2626-2630,2002.
19. D. Olejfir and M. Stanek, " On cryptographic properties of random Boolean functions, " Journal of Universal Computer Science, vol. 4, No.8, pp. 705-717, 1998.
20. O. S. Rothaus, " On bent functions," J. Comb. Theory, 20A, pp. 300-305,1976.
21. P. Savicb, " On the bent Boolean functions that are symmetric, " Eur: J. Combinatorics 15,407-410 (1994).
22. C.E. Shannon, " A mathematical theory of communication, " Bell system technical journal, 27, pp. 379-423, 1948.
23. C.E. Shannon, " Communication theory of secrecy systems, " Bell system technical journal, 28, pp. 656715, 1949.
24. C.E. Shannon, " The synthesis of two-terminal switching circuits, " Bell system technical joumal, 28, pp. 59-98, 1949.
25. I. Wegener. The complexity of Boolean functions, B.G. Teubner, Stuttgart. John Wiley and sons. 1987.
26. Y. Zheng, X.-M. Zhang and H. Imai, "Restriction, terms and nonlinearity of Boolean functions, " Theoretical Computer Science, 226(1-2), pp. 207-223.1999.