Construction of bent functions via Niho power functions

Journal of Combinatorial Theory. Series A

Volumn 113, Issue 5, 2006, Pages 779-798

  Dobbertin, Hans ^a   Leander, Gregor ^a   Canteaut, Anne ^b   Carlet, Claude ^b   Felke, Patrick ^a   Gaborit, Philippe ^c  

^a RUHR UNIVERSITY BOCHUM   (Germany)

^b INRIA   (France)

^c UNIVERSITY OF LIMOGES   (France)

Author keywords

Bent function; Boolean function; Niho exponent

Indexed keywords

EID: 33747177041     PISSN: 00973165     EISSN: 10960899     Source Type: Journal    
DOI: 10.1016/j.jcta.2005.07.009     Document Type: Article

References (11)

1. M. Daum, H. Dobbertin, G. Leander, An algorithm for checking normality of Boolean functions, in: Proceedings of the Workshop on Coding and Cryptography (WCC 2003), Versailles, France, March 2003, pp. 133-142.
2. J.F. Dillon, Elementary Hadamard difference sets, in: Proceedings of the Sixth Southeastern Conference on Combinatorics, Graph Theory and Computing, Boca Raton, Florida, Congressus Numerantium No. XIV, Utilitas Mathematics, Winnipeg, Manitoba, 1975, pp. 237-249.
3. J.F. Dillon, H. Dobbertin, New cyclic difference sets with Singer parameters, Finite Fields Appl. 10 (2004) 342-389.
4. Dobbertin H. Construction of bent functions and highly nonlinear balanced Boolean functions. In: Preneel B. (Ed). Fast Software Encryption, Lecture Notes on Computer Science vol. 1008 (1995), Springer, Berlin 61-74
5. n ), AAECC Applicable Algebra in Engineering. Comm. Comput. 9 (1998) 139-152
6. Dobbertin H. Uniformly representable permutation polynomials. In: Helleseth T., Kumar P.V., and Yang K. (Eds). The Proceedings of "Sequences and Their Applications-SETA '01" (2002), Springer, London 1-22
7. H. Dobbertin, P. Felke, T. Helleseth, P. Rosendahl, Niho type cross-correlation functions via Dickson 33 polynomials and Kloosterman sums, IEEE Trans. Inform. Theory, to be published.
8. McFarland R.L. A family of difference sets in non-cyclic groups. J. Combin. Theory Ser. A 15 (1973) 1-10
9. Y. Niho, Multivalued cross-correlation functions between two maximal linear recursive sequences, Ph.D. Thesis, University of Southern California, 1972.
10. K. Nyberg, Perfect non-linear S-boxes, in: D.W. Davies (Ed.), Advances in Cryptology-Eurocrypt '91, vol. 547, Lecture Notes in Computer Science, Springer, Berlin, 1991, pp. 378-386.
11. Rothaus O.S. On "bent" functions. J. Combin. Theory Ser. A 20 (1976) 300-305