Open Access
Issue
Wuhan Univ. J. Nat. Sci.
Volume 30, Number 3, June 2025
Page(s) 231 - 234
DOI https://doi.org/10.1051/wujns/2025303231
Published online 16 July 2025

© Wuhan University 2025

Licence Creative CommonsThis is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

0 Introduction

Let Fq be the finite field with q elements. A polynomial f(x)Fq[x] is called a permutation polynomial if f induces a bijection from Fq to itself. Permutation polynomials have wide applications in coding theory, cryptography and combinatorial designs. We refer the readers to Refs. [1-3] for more details of the recent advances.

Permutation polynomials with a few terms have attracted more attention in recent years for their simple algebraic forms and some special properties. There are several classes of permutation trinomials of the form xrh(xq-1) over Fq2 constructed in recent years. Kyureghyan and Zieve[4] described a class of permutation trinomials having the form x+γTrq2/q(x(q2+1)/4) of Fq2, where Trq2/q is the trace function from Fq2 to Fq. We note that this kind of permutation trinomials actually has the form x(1+γxq+34(q-1)+γx(q2+3q4+1)(q-1)). Zheng et al[5] showed a class of permutation trinomials of the form cx-xs+xsq, where s=3q2+2q-14, which can be rewritten as x(c-x3q+54(q-1)+x(3q2+5q4+1)(q-1)). In Ref. [6], the authors got several classes of more generalized permutation trinomials having similar forms to xr(c+x(q+34+k)(q-1)+x(q2+3q4++k+1)(q-1))

and xr(c-x(q+34+k)(q-1)+x(q2+3q4++k+1)(q-1)). By using a similar idea to Ref. [6], Lavorante[7] constructed a few new families of permutation trinomials with the form xr(c+xs(q-1)+xt(q-1)). By using monomial functions on the cosets of a subgroup of μq+1, Hou and Lavorante[8] gave a general method to construct permutation polynomials over Fq2. Specially, they presented several classes of permutation binomials and trinomials.

On the other hand, permutation quadrinomials also have attracted attention in recent years. Especially, constructing permutation quadrinomials of the form

f r , a , b , c , s , t , u ( x ) = x r ( 1 + a x s ( q - 1 ) + b x t ( q - 1 ) + c x u ( q - 1 ) ) F q 2 [ x ] (1)

where r,s,t are integers, attracted great interest recently. Gupa[9] studied several classes of permutation quadrinomials of the form (1) over Fq2 with Char(Fq)=3,5. Tu et al[10] proposed a class of permutation quadrinomials having the form x3(1+axq-1+bx2(q-1)+cx3(q-1)) of F22m. In Ref. [11], the authors investigated some permutation quadrinomials of F22m with the case of (r,s,t,u)=(1,-1,1,2) in (1) under some restrictive conditions. In Ref. [12], the authors provided more classes of permutation quadrinomials of the form (1) in characteristic two. Lavorante[13] used the Hasse-Weil type theorems to prove the necessary conditions for a polynomial in Ref. [12] to be a permutation polynomial. Ding and Zieve[14] determined all permutation polynomials over Fq2 having the form xrh(xq-1), where, for some Q which is the power of the character of Fq, the terms of h(x) have degrees {0,1,Q,Q+1} and rQ+1(modq+1). The authors in Ref. [15] characterized two classes of permutation quadrinomials over F2n by using self-reciprocal polynomials. In this paper, motivated by the method in Ref. [6], we continue to construct a new class of permutation quadrinomials of Fq2.

This paper is organized as follows: In Section 1, we list some results, which will be used in our paper. In Section 2, by using monomials of μq+12 and -μq+12, we construct a class of permutation quadrinomials over Fq2 of the form xr(1+axs(q-1)+bxt(q-1)+cxu(q-1)) for some integers r,s,t,u.

1 Preliminary

The following result was discovered independently by several authors.

Lemma 1[16-17] Let r be a positive integer. Then f(x)=xrh(xq-1)Fq2[x] is a permutation polynomial of Fq2 if and only if each of the following is true:

(1) gcd(r,q-1)=1,

(2) xrh(x)q-1 permutes q+1-th roots of unity μq+1.

Specially, by using Lemma 1, constructing permutation polynomials of the form xrh(xq-1) over Fq2 translates to finding permutations having the form xrh(x)q-1 on the set of q+1-th roots of unity μq+1. For xμq+1, one has

x r h ( x ) q - 1 = x r h ( x ) q h ( x ) = x r h q ( x - 1 ) h ( x )

where hq(x) denotes the polynomial obtained h(x) by raising every coefficient to the q-th power. Thus to show that xrh(xq-1) permutes Fq2, the point is to prove that the rational function xrhq(x-1)h(x) permutes μq+1.

Let d|q+1 with d2 be a positive integer and ξ be a primitive d-th root of unity. We make some denotations: S0=μq+1d and Si=ξiS0 for 1id-1. It is easy to imply that μq+1=i=0d-1Si and SiSj= for 0ijd-1.

For g(x)Fq2[x], if g(x) is a monomial on each subset of μq+1, then by using the piecewise method, we can easily determine the permutational property of g(x) on μq+1 in the following lemma.

Lemma 2[6] Let q+1d be a positive integer and Aiμq+1 for 0id-1. For g(x)Fq2[x], if

g ( x ) = A i x r i ,   f o r   x S i .

Then g(x) permutes μq+1 if and only if each of the following is true:

( 1 )   g c d ( r i , q + 1 d ) = 1 ,   f o r   0 i d - 1 ;

( 2 )   A i x i r i A j x j r j   f o r   x i S i   a n d   x j S j .

Lemma 2   provides an approach to study the permutational property of xrhq(x-1)h(x) on μq+1 via monomials on the subsets Si. In Refs. [4,5,7], the authors used the case d=2 in Lemma 2 to construct a few classes of permutation trinomials of Fq2. By using the cases d=3, the authors obtained several kinds of permutation trinomials of Fq2 in Refs. [16,18].

2 Main Results

Motivated by the method in Ref. [6], we characterize several classes of permutation quadrinomials over Fq2 in this section.

Theorem 1   Let q be a prime power with q1 (mod8), and a,b,cFq2 satisfy (a+b+c)q+12=1 and (b-c-a)q+12=1. Let r be a positive integer and k be an even integer. Then f(x)=xr(1+ax(q+34+k)(q-1)+bx(3q+54+k)(q-1)

+ c x ( 3 q 2 + 5 q 4 + k + 1 ) ( q - 1 ) ) permutes Fq2 if and only if gcd(r,q-1)=1 and gcd(2r-2k-1,q+12)=1.

Proof   It follows from Lemma 1 that f(x) permutes Fq2 if and only if gcd(r,q-1)=1 and g(x)=xr(1+axu+k+bxv+k+cxqv+k+1)q-1 permutes μq+1, where u=q+34,v=3q+54.

In the following, we claim that if gcd(r,q-1)=1, then g(x) permutes μq+1 if and only if gcd(2r-2k-1,q+12)=1.

We divide μq+1 into two subsets μq+12 and -μq+12, and consider the following cases. For x in μq+12, it is easy to check that xu=xv=xqv+1=x1-v. One has g(x)=xr(1+(a+b+c)xu+k)q-1.

Since q1 (mod8), we have that q+12 is odd. Then by (a+b+c)q+12=1, we deduce that the equation 1+(a+b+c)xu+k=0 has no roots in μq+12. Furthermore,

g ( x ) = x r 1 + ( a + b + c ) q x - u - k 1 + ( a + b + c ) x u + k = ( a + b + c ) q x r - k - u 1 + x k + u ( a + b + c ) q 1 + ( a + b + c ) x u + k .

By using (a+b+c)q+12=1, g(x) can be simplified as 1a+b+cxr-k-u. Since xμq+12 can be written as y2 for yμq+12 and 2u1 (modq+12), thus g(x) can be rewritten as 1a+b+cy2r-2k-1.

For x in -μq+12, one has xu=-xv=xqv+1=x1-v. Then

g ( x ) = x r ( 1 + a x u + k + b x v + k + c x q v + 1 + k ) q - 1 = x r ( 1 + ( a - b + c ) x u + k ) q - 1 .

Since q1 (mod8), we have that u and q+12 are odd, thus u+k is odd. Then by (b-c-a)q+12=1, we know that 1+(a-b+c)xu+k0 for x-μq+12. Thus

g ( x ) = x r 1 + ( a - b + c ) q x - u - k 1 + ( a - b + c ) x u + k = ( a - b + c ) q x r - k - u 1 + x k + u ( a - b + c ) q 1 + ( a - b + c ) x u + k .

Since (a-b+c)q=1a-b+c and 1(a-b+c)q=a-b+c, then g(x)=1a-b+cxr-k-u. For x-μq+12, there exists yμq+12 such that x can be presented by -y2. Then g(x)=1a-b-cy2r-2k-1.

Note that 1a+b+cμq+12 and 1a-b+c-μq+12. Then it follows from Lemma 2 that g(x) permutes μq+1 if and only if gcd(2r-2k-1,q+12)=1. Namely, the claim is true.

Therefore, we can conclude that f(x) permutes Fq2 if and only if gcd(r,q-1)=1 and gcd(2r-2k-1,q+12)=1.

We complete the proof of Theorem 1.

Similarly, we can get the following results, and we omit their detailed proofs.

Theorem 2   Let q be a prime power with q1 (mod8), and a,b,cFq2 satisfy (a+b+c)q+12=1 and (b-a+c)q+12=1. Let r be a positive integer and k be an even integer. Then f(x)=xr(1+ax(q+34+k)(q-1)+bx(3q+54+k)(q-1)

+ c x ( q 2 + 3 q 4 + k + 1 ) ( q - 1 ) ) permutes Fq2 if and only if gcd(r,q-1)=1 and gcd(2r-2k-1,q+12)=1.

Theorem 3   Let q be a prime power with q1 (mod8), and a,b,cFq2 satisfy (a+b+c)q+12=1 and (b-a-c)q+12=1. Let r be a positive integer and k be an even integer. Then f(x)=xr(1+ax(q+34+k)(q-1)+bx(q2+3q4+k)(q-1)

+ c x ( 3 q 2 + 5 q 4 + k + 1 ) ( q - 1 ) ) permutes Fq2 if and only if gcd(r,q-1)=1 and gcd(2r-2k-1,q+12)=1.

Theorem 4   Let q be a prime power with q1 (mod8), and a,b,cFq2 satisfy (a+b+c)q+12=1 and (a+b-c)q+12=1. Let r be a positive integer and k be an even integer. Then f(x)=xr(1+ax(3q+54+k)(q-1)+bx(q2+3q4+k)(q-1)

+ c x ( 3 q 2 + 5 q 4 + k + 1 ) ( q - 1 ) ) permutes Fq2 if and only if gcd(r,q-1)

= 1   a n d   g c d ( 2 r - 2 k - 1 , q + 1 2 ) = 1 .

References

  1. Hou X D. Permutation polynomials over finite fields: A survey of recent advances[J]. Finite Fields and Their Applications, 2015, 32: 82-119. [Google Scholar]
  2. Li N, Zeng X Y. A survey on the applications of niho exponents[J]. Cryptography and Communications, 2019, 11(3): 509-548. [Google Scholar]
  3. Wang Q. Combinatorics and Finite Fields[M]. Berlin: De Gruyter, 2019. [Google Scholar]
  4. Kyureghyan G, Zieve M. Contemporary Developments in Finite Fields and Applications[M]. Singapore: World Scientific, 2016. [Google Scholar]
  5. Zheng D B, Yuan M, Yu L. Two types of permutation polynomials with special forms[J]. Finite Fields and Their Applications, 2019, 56: 1-16. [Google Scholar]
  6. Qin X E, Yan L. Constructing permutation trinomials via monomials on the subsets of μq+1[J]. Applicable Algebra in Engineering, Communication and Computing, 2021, 34(2): 321-334. [Google Scholar]
  7. Lavorante V P. New families of permutation trinomials constructed by permutations of μq+1[EB/OL]. [2023-2-15]. https://arxiv.org/abs/2105.12012. [Google Scholar]
  8. Hou X D, Lavorante V. P. A general construction of permutation polynomials of Formula [J]. Finite Fields Appl, 2023, 89: 102193. [Google Scholar]
  9. Gupta R. Several new permutation quadrinomials over finite fields of odd characteristic[J]. Designs, Codes and Cryptography, 2020, 88(1): 223-239. [Google Scholar]
  10. Tu Z, Zeng X Y, Helleseth T. New permutation quadrinomials over Formula [J]. Finite Fields Appl, 2018, 50: 304-318. [Google Scholar]
  11. Tu Z R, Zeng X Y, Helleseth T. A class of permutation quadrinomials[J]. Discrete Mathematics, 2018, 341(11): 3010-3020. [Google Scholar]
  12. Zheng L J, Liu B X, Kan H B, et al. More classes of permutation quadrinomials from Niho exponents in characteristic two[J]. Finite Fields and Their Applications, 2022, 78: 101962. [Google Scholar]
  13. Pallozzi Lavorante V P. On permutation quadrinomials from Niho exponents in characteristic two[J]. Finite Fields and Their Applications, 2024, 96: 102418. [Google Scholar]
  14. Ding Z G, Zieve M E. Determination of a class of permutation quadrinomials[J]. Proceedings of the London Mathematical Society, 2023, 127(2): 221-260. [Google Scholar]
  15. Brochero Martínez F E, Gupta R, Quoos L. Classification of some permutation quadrinomials from self reciprocal polynomials over Formula [J]. Finite Fields and Their Applications, 2023, 91: 102276. [Google Scholar]
  16. Akbary A, Wang Q. On polynomials of the form xrf(xq-1/l)[J]. Int J Math Math Sci, 2007, 2007: 23408. [Google Scholar]
  17. Wang Q. Cyclotomic mapping permutation polynomials over finite fields[C]//Sequences, Subsequences, and Consequences. Berlin: Springer-Verlag, 2007: 119-128. [Google Scholar]
  18. Li K Q, Qu L J, Chen X, et al. Permutation polynomials of the form Formula and permutation trinomials over finite fields with even characteristic[J]. Cryptography and Communications, 2018, 10(3): 531-554. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.