New constructions of permutation polynomials of the form x^rh( x^q-1) over F_q^2

From MaRDI portal
Publication:1671644



Abstract: Permutation polynomials over finite fields have been studied extensively recently due to their wide applications in cryptography, coding theory, communication theory, among others. Recently, several authors have studied permutation trinomials of the form xrhleft(xq1ight) over mathbbFq2, where q=2k, h(x)=1+xs+xt and r,s,t,k>0 are integers. Their methods are essentially usage of a multiplicative version of AGW Criterion because they all transformed the problem of proving permutation polynomials over mathbbFq2 into that of showing the corresponding fractional polynomials permute a smaller set muq+1, where muq+1:=xinmathbbFq2:xq+1=1. Motivated by these results, we characterize the permutation polynomials of the form xrhleft(xq1ight) over mathbbFq2 such that h(x)inmathbbFq[x] is arbitrary and q is also an arbitrary prime power. Using AGW Criterion twice, one is multiplicative and the other is additive, we reduce the problem of proving permutation polynomials over mathbbFq2 into that of showing permutations over a small subset S of a proper subfield mathbbFq, which is significantly different from previously known methods. In particular, we demonstrate our method by constructing many new explicit classes of permutation polynomials of the form xrhleft(xq1ight) over mathbbFq2. Moreover, we can explain most of the known permutation trinomials, which are in [6, 13, 14, 16, 20, 29], over finite field with even characteristic.



Cites work


Cited in
(52)








This page was built for publication: New constructions of permutation polynomials of the form \(x^rh\left( x^{q-1}\right) \) over \({\mathbb F}_{q^2}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1671644)