On bent and semi-bent quadratic Boolean functions

IEEE Transactions on Information Theory

Volumn 51, Issue 12, 2005, Pages 4286-4298

  Charpin, Pascale ^a   Pasalic, Enes ^b   Tavernier, Cédric ^c  

^a INRIA   (France)

^b TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

^c THALES COMMUNICATIONS   (France)

Author keywords

Bent function; Boolean function; Linear permutation; M sequence; Nonlinearity; Quadratic mapping; Semi bent function

Indexed keywords

BOOLEAN FUNCTIONS; CORRELATION METHODS; ITERATIVE METHODS; POLYNOMIALS; THEOREM PROVING;

BENT FUNCTION; LINEAR FEEDBACK SHIFT REGISTER (LFSR); LINEAR PERMUTATION; M-SEQUENCE; QUADRATIC MAPPING; SEMI-BENT FUNCTION;

INFORMATION THEORY;

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

References (15)

1. A. Canteaut, C. Carlet, P. Charpin, and C. Fontaine, "On cryptographic properties of the cosets of R(1, m)," IEEE Trans. Inf. Theory, vol. 47, no. 4, pp. 1494-1513, May 2001.
2. A. Canteaut and P. Charpin, "Decomposing bent functions," IEEE Trans. Inf. Theory, vol. 49, no. 8, pp. 2004-2019, Aug. 2003,
3. C. Carlet, "Codes de Reed-Muller, Codes de Kerdock et de Preparata," Ph.D. dissertation, Université Paris 6, Paris, France, 1990.
4. C. Carlet, P. Charpin, and V. A. Zinoviev, "Codes, bent functions and permutations suitable for DES-like cryptosystems," Des., Codes Cryptogr., vol. 15, pp. 125-156, 1998.
5. C. Carlet, "A larger class of cryptographic boolean functions via a study of the Maiorana-Mcfarland construction," in Advances in Cryptology - CRYPT0 2002 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 2002, vol. 2442, pp. 549-564.
6. P. Charpin, "Normal boolean functions," J. Complexity, vol. 20, pp. 245-265, 2004.
7. R. Gold, "Maximale recursive sequences with 3-valued recursive cross-correlation functions," IEEE Trans. Inf. Theory, vol. IT-14, no. 1, pp. 154-156, Jan. 1968.
8. K. Khoo, G. Gong, and D. R. Stinson, "A new family of Gold-like sequences," in Proc. IEEE Int. Symp. Information Theory, Lausanne, Switzerland, Jun./Jul. 2002, p. 181.
9. K. Khoo, G. Gong, and D. R. Stinson, "A new characterization of semi-bent and bent functions on finite fields," Des., Codes, Cryptogr., to be published.
10. T. Helleseth, "Some results about the cross-correlation function between two maximal linear sequences," Discr. Math., vol. 16, pp. 209-232, 1976.
11. T. Helleseth, "Correlation of m-sequences and related topics," in Proc. SETA'98, Discrete Mathematics and Theoretical Computer Science, C. Ding, T. Helleseth, and H. Niederreiter, Eds. London, U.K.: Springer, 1999, pp. 49-66.
12. T. Helleseth and P. V. Kumar, "Sequences with low correlation," in Handbook of Coding Theory, Part 3: Applications, V. S. Pless, W. C. Huffman, and R. A. Brualdi, Eds. Amsterdam, The Netherlands: Elsevier, 1998, ch. 21.
13. R. Lidl and H. Niederreiter, "Finite Fields," in Encyclopedia of Mathematics and Its Applications. Reading, MA: Addison-Wesley, 1983, vol. 20.
14. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1986.
15. Y. Niho, "Multi-valued cross-correlation functions between two maximal linear recursive sequences," Ph.D. dissertation, Univ. Sothern Calif., Los Angeles, 1972.