Title :
Hyper-bent functions via Dillon-like exponents
Author :
Mesnager, Sihem ; Flori, Jean-Pierre
Author_Institution :
Dept. of Math., Univ. of Paris XIII, St. Denis, France
Abstract :
This paper is devoted to hyper-bent functions with multiple trace terms (including binomial functions) via Dillon-like exponents. We show how the approach developed by Mesnager to extend the Charpin-Gong family, which was also used by Wang et al. to obtain another similar extension, fits in a much more general setting. To this end, we first explain how the original restriction for Charpin-Gong criterion can be weakened before generalizing the Mesnager approach to arbitrary Dillon-like exponents. Afterward, we tackle the problem of devising infinite families of extension degrees for which a given exponent is valid and apply these results not only to reprove straightforwardly the results of Mesnager, and Wang et al., but also to characterize the hyper-bentness of new infinite classes of Boolean functions.
Keywords :
Boolean functions; Boolean functions; Charpin-Gong criterion; Dillon-like exponents; Mesnager approach; arbitrary Dillon-like exponents; hyper-bent functions; infinite classes; infinite extension degree family; Argon; Boolean functions; Cryptography; Educational institutions; Polynomials; Transforms; Boolean functions; Dickson polynomials; Dillon exponents; Walsh-Hadamard transform; exponential sums; hyper-bent functions;
Conference_Titel :
Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on
Conference_Location :
Cambridge, MA
Print_ISBN :
978-1-4673-2580-6
Electronic_ISBN :
2157-8095
DOI :
10.1109/ISIT.2012.6284678