Permutation polynomials of the form \(x^r h (x^{q-1})\) over \(\mathbb{F}_{q^2}\) with even characteristics (Q7007883)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 8015948
Language Label Description Also known as
default for all languages
No label defined
    English
    Permutation polynomials of the form \(x^r h (x^{q-1})\) over \(\mathbb{F}_{q^2}\) with even characteristics
    scientific article; zbMATH DE number 8015948

      Statements

      Permutation polynomials of the form \(x^r h (x^{q-1})\) over \(\mathbb{F}_{q^2}\) with even characteristics (English)
      0 references
      0 references
      0 references
      25 March 2025
      0 references
      Let \(p\) be a prime, \(q\) a power of \(p\), and \(\mathbb{F}_q\) denote the finite field with \(q\) elements. A polynomial \(f\in \mathbb{F}_q[x]\) is called a \textit{permutation polynomial} (PP) of \(\mathbb{F}_q\) if the associated mapping \(x\mapsto f(x)\) from \(\mathbb{F}_q\) to \(\mathbb{F}_q\) is a permutation of \(\mathbb{F}_q\). Permutation polynomials over finite fields have important applications in coding theory, cryptography, finite geometry, combinatorics and computer science, and among other fields.\N\NStudying the permutation behaviour of binomials, trinomials, quadrinomials, and pentanomials has been a hot topic over the last decade. However, finding new classes of permutation quadrinomials and pentanomials has been a more difficult task. In general, it is difficult to find conditions on the coefficients which are necessary and sufficient for a polynomial to be a permutation polynomial.\N\NLet \(r\) be a positive integer, \(d\,|\,q-1\), and \(h(X)\in \mathbb{F}_q[x]\). It is well known that \(X^rh(X^{(q-1)/d})\) is a permutation polynomial of \(\mathbb{F}_q\) if and only if \(\text{gcd}(r,(q-1)/d)=1\) and \(X^rh(X)^{(q-1)/d}\) permutes the multiplicative group \(\mu_d:=\{x\in \mathbb{F}_q^*\,:\,x^d=1\}\). Replacing \(q\) with \(q^2\) and \(d\) with \(q+1\), we see that for \(h(X)\in \mathbb{F}_{q^2}[X]\), \(X^rh(X^{q-1})\) is a permutation polynomial of \(\mathbb{F}_{q^2}\) if and only if \(\text{gcd}(r,q-1)=1\) and \(X^rh(X)^{q-1}\) permutes \(\mu_{q+1}\).\N\NIn the paper under review, inspired by the earlier work, the authors study the permutation property of \(f(X)=X^rh(X^{q-1})\) over \(\mathbb{F}_{q^2}\) using the criterion explained in the previous paragraph for certain positive integers \(r\) and \(h(x)\in \mathbb{F}_q[x]\) as listed below:\N\N\begin{itemize}\N\item[1.] \(r=5\), \(h(x)=x^5+ax^4+bx^3+cx^2+ax+1\)\N\item[2.] \(r=4\), \(h(x)=x^4+ax^3+bx^2+cx+d\)\N\item[3.] \(r=3\), \(h(x)=ax^4+x^3+bx^2+x^{-1}+a\), where the exponent \(-1\) is taken modulo \(q+1\).\N\item[4.] \(r=3\), \(h(x)=ax^4+bx^3+bx+x^{-1}+a\), where the exponent \(-1\) is taken modulo \(q+1\).\N\item[5.] \(r=5\), \(h(x)=x^3+ax^2+bx+b\)\N\item[6.] \(r=1\), \(h(x)=x^3+x^2+ax+b\)\N\end{itemize}
      0 references
      finite fields
      0 references
      permutation polynomials
      0 references
      0 references

      Identifiers