I. Wegener, The Complexity of Boolean Functions, 1987.

J. O. Brüer, On pseudorandom sequences as crypto generators, Proc. 1984 Int. Zürich Seminar on Digital Communications,Z ürich, pp.157-161, 1984.

C. J. Mitchell, Enumerating Boolean functions of cryptographic significance, Journal of Cryptology, vol.2, issue.3, pp.155-170, 1990.
DOI : 10.1007/BF00190802

B. Guo and X. Yang, Further enumerating Boolean functions of cryptographic significance, J. Cryptol, vol.8, issue.3, pp.115-122, 1995.

P. Savicky, On the Bent Boolean Functions That are Symmetric, European Journal of Combinatorics, vol.15, issue.4, pp.407-410, 1994.
DOI : 10.1006/eujc.1994.1044

S. Maitra and P. Sarkar, Maximum nonlinearity of symmetric Boolean functions on odd number of variables, IEEE Transactions on Information Theory, vol.48, issue.9, pp.2626-2630, 2002.
DOI : 10.1109/TIT.2002.801482

K. Gopalakrishnan, D. Hoffman, and D. Stinson, A note on a conjecture concerning symmetric resilient functions, Information Processing Letters, vol.47, issue.3, pp.139-143, 1993.
DOI : 10.1016/0020-0190(93)90237-4

J. Zur-gathen and J. Roche, Polynomials with two values, Combinatorica, vol.23, issue.3, pp.345-362, 1997.
DOI : 10.1007/BF01215917

P. Sarkar and S. Maitra, Balancedness and correlation immunity of symmetric Boolean functions, Proc. R. C. Bose Centenary Symp, pp.178-183, 2003.

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, issue.4, pp.1494-1513, 2001.
DOI : 10.1109/18.923730

M. M. Adv, Linear cryptanalysis method for DES cipher Cryp- tology?EUROCRYPT'93 (Lecture Notes in Computer Science), pp.386-397, 1993.

O. Rothaus, On ???bent??? functions, Journal of Combinatorial Theory, Series A, vol.20, issue.3, pp.300-305, 1976.
DOI : 10.1016/0097-3165(76)90024-8

L. Comtet, Advanced Combinatorics. Amsterdam, The Netherlands: Reidel, 1974.

E. Dawson and C. Wu, On the linear structure of symmetric Boolean functions, Australas. J. Comb, vol.16, pp.239-243, 1997.

T. Siegenthaler, Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.), IEEE Transactions on Information Theory, vol.30, issue.5, pp.776-780, 1984.
DOI : 10.1109/TIT.1984.1056949

]. B. Preneel, W. Leekwijck, L. Linden, R. Govaerts, and J. Vandewalle, Propagation Characteristics of Boolean Functions, Adv. Cryp- tology?EUROCRYPT'90, pp.155-165, 1991.
DOI : 10.1007/3-540-46877-3_14

W. Meier and O. Staffelbach, Nonlinearity criteria for cryptographic functions, " in Adv. Cryptology?EUROCRYPT'89 (Lecture Notes in Computer Science), pp.549-562, 1990.

A. Gouget, On the Propagation Criterion of Boolean Functions, Coding, Cryptography and Combinatorics. ser. Progr. Comput. Sci
DOI : 10.1007/978-3-0348-7865-4_9

J. Dillon, Elementary Hadamard difference sets, 1974.