Finding nonnormal bent functions

Discrete Applied Mathematics

Volumn 154, Issue 2, 2006, Pages 202-218

  Canteaut, Anne ^a   Daum, Magnus ^b   Dobbertin, Hans ^b   Leander, Gregor ^b  

^a INRIA   (France)

^b RUHR UNIVERSITY BOCHUM   (Germany)

Author keywords

Algorithm; Bent function; Boolean function; Normal function

Indexed keywords

ALGORITHMS; PARAMETER ESTIMATION;

BENT FUNCTION; NORMAL FUNCTION;

BOOLEAN FUNCTIONS;

EID: 29244434843     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2005.03.027     Document Type: Conference Paper

References (9)

1. A. Canteaut, and P. Charpin Decomposing bent functions IEEE Trans. Inform. Theory 49 8 2003 2004 2019
2. C. Carlet, Two new classes of bent functions, in: Advances in Cryptology - EUROCRYPT'93, Lecture Notes in Computer Science, vol. 765, Springer, Berlin, 1994, pp. 77-101.
3. C. Carlet On cryptographic complexity of Boolean functions Finite Fields with Applications to Coding Theory, Cryptography and Related Areas (Proceedings of Fq6) 2002 Springer Berlin 53 69
4. P. Charpin, Normal Boolean functions, J. Complexity 20 (2004) 245-265 (special issue) ("Complexity Issues in Cryptography and Coding Theory", dedicated to Prof. Harald Niederreiter on the occasion of his 60th birthday.)
5. J.F. Dillon, Elementary hadamard difference sets, Ph.D. Thesis, University of Maryland, USA, 1974.
6. J.F. Dillon, H. Dobbertin, New cyclic difference sets with Singer parameters, Finite Fields Appl. 10 (2004) 342-389.
7. H. Dobbertin, Construction of bent functions and balanced Boolean functions with high nonlinearity, in: Fast Software Encryption - FSE'94, Lecture Notes in Computer Science, vol. 1008, Springer, Berlin, 1995, pp. 61-74.
8. S. Dubuc-Camus, Etude des fonctions booléennes dégénérées et sans corrélation, Ph.D. Thesis, Université de Caen, France, 1998.
9. B. Preneel, Analysis and design of cryptographic hash functions, Ph.D. Thesis, Katholieke Universiteit Leuven, Belgium, 1993.