DocumentCode
847548
Title
Hyperbent Functions, Kloosterman Sums, and Dickson Polynomials
Author
Charpin, Pascale ; Gong, Guang
Author_Institution
INRIA-Rocquencourt, Le Chesnay
Volume
54
Issue
9
fYear
2008
Firstpage
4230
Lastpage
4238
Abstract
This paper is devoted to the study of hyperbent functions in n variables, i.e., bent functions which are bent up to a change of primitive roots in the finite field GF(2n). Our main purpose is to obtain an explicit trace representation for some classes of hyperbent functions. We first exhibit an infinite class of monomial functions which is not hyperbent. This result indicates that Kloosterman sums on F2 m cannot be zero at some points. For functions with multiple trace terms, we express their spectra by means of Dickson polynomials. We then introduce a new tool to describe these hyperbent functions. The effectiveness of this new method can be seen from the characterization of a new class of binomial hyperbent functions.
Keywords
Boolean functions; information theory; polynomials; Dickson polynomials; Kloosterman sums; hyperbent functions; Boolean functions; Codes; Context; Galois fields; Polynomials; Bent function; Boolean function; Dickson polynomial; Kloosterman sum; hyperbent function; permutation polynomial; quadratic function;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.2008.928273
Filename
4608958
Link To Document