an:06255367
Zbl 1302.11096
Muratovi??-Ribi??, Amela; Pasalic, Enes
A note on complete polynomials over finite fields and their applications in cryptography
EN
Finite Fields Appl. 25, 306-315 (2014).
00329057
2014
j
11T06 11T71 94A60
finite fields; complete permutation polynomials; bent-negabent functions; planar mappings
Summary: A recursive construction of complete mappings over finite fields is provided in this work. These permutation polynomials, characterized by the property that both \(f(x)\in\mathbb F_q[x]\) and its associated mapping \(f(x)+x\) are permutations, have an important application in cryptography in the construction of bent-negabent functions which actually leads to some new classes of these functions. Furthermore, we also provide a recursive construction of mappings over finite fields of odd characteristic, having an interesting property that both \(f(x)\) and \(f(x+c)+f(x)\) are permutations for every \(c\in\mathbb F_q\). Both the multivariate and univariate representations are treated and some results concerning fixed points and the cycle structure of these permutations are given. Finally, we utilize our main result for the construction of so-called negabent functions and bent functions over finite fields.