Vectorial Bent Functions From Multiple Terms Trace Functions

• Published in: IEEE transactions on information theory 2014-02, Vol.60 (2), p.1337-1347
• Main Authors: Muratovic-Ribic, Amela, Pasalic, Enes, Bajric, Samed
• Format: Article
• Language: English
• Subjects: Applied sciences; Binomial distribution; Binomial trace functions; Binomials; Boolean functions; Cryptography; Equivalence; Exact sciences and technology; Functions (mathematics); Generators; Information theory; Information, signal and communications theory; linearized polynomials; Links; Mathematical analysis; Mathematical functions; Polynomials; Signal and communications theory; symmetric polynomials; Symmetry; Telecommunications and information theory; Transforms; Unity; vectorial bent functions
• ISSN: 0018-9448; 1557-9654
• DOI: 10.1109/TIT.2013.2290709

In this paper, we provide necessary and sufficient conditions for a function of the form F(x)=Trk 2k (Σi=1 t aix ri(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 (2 k +1)th primitive roots of unity in GF(2 2k ). More precisely, for this group of cardinality 2 k +1 given by U={u ∈ GF(2 2k ):u 2k +1=1}, it is shown that the property of being vectorial bent implies that Im(F)=GF(2 k )∪{0}, if F is evaluated on U, that is, F(u) takes all possible values of GF(2 k )* 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 Trk 2k (λx r(2k -1)) is never a vectorial bent function.