DocumentCode
105772
Title
Vectorial Bent Functions From Multiple Terms Trace Functions
Author
Muratovic-Ribic, Amela ; Pasalic, Enes ; Bajric, Samed
Author_Institution
Dept. of Math., Univ. of Sarajevo, Sarajevo, Bosnia-Herzegovina
Volume
60
Issue
2
fYear
2014
fDate
Feb. 2014
Firstpage
1337
Lastpage
1347
Abstract
In this paper, we provide necessary and sufficient conditions for a function of the form F(x)=Trk2k(Σi=1taixri(2k-1)) to be bent. Three equivalent statements, all of them providing both the necessary and sufficient conditions, are derived. In particular, one characterization provides an interesting link between the bentness and the evaluation of F on the cyclic group of the (2k+1)th primitive roots of unity in GF(22k). More precisely, for this group of cardinality 2k+1 given by U={u ∈ GF(22k):u2k+1=1}, it is shown that the property of being vectorial bent implies that Im(F)=GF(2k)∪{0}, if F is evaluated on U, that is, F(u) takes all possible values of GF(2k)* exactly once and the zero value is taken twice when u ranges over U. This condition is then reformulated in terms of the evaluation of certain elementary symmetric polynomials related to F, which in turn gives some necessary conditions on the coefficients ai (for binomial trace functions) that can be stated explicitly. Finally, we show that a bent trace monomial of Dillon´s type Trk2k(λxr(2k-1)) is never a vectorial bent function.
Keywords
Galois fields; binomial distribution; polynomials; vectors; GF(2k); binomial trace functions; cyclic group; elementary symmetric polynomials; equivalent statements; multiple terms trace functions; primitive roots; vectorial bent functions; zero value; Boolean functions; Cryptography; Generators; Information theory; Polynomials; Transforms; Binomial trace functions; Boolean functions; cryptography; linearized polynomials; symmetric polynomials; vectorial bent functions;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.2013.2290709
Filename
6672010
Link To Document