Permutation polynomial

Single variable permutation polynomials over finite fields

Let be the finite field of characteristic p, that is, the field having q elements where for some prime p. A polynomial f with coefficients in Fq (symbolically written as f ∈ Fq[x]) is a permutation polynomial of Fq if the function from Fq to itself defined by c \mapsto f(c) is a permutation of Fq.

Due to the finiteness of Fq, this definition can be expressed in several equivalent ways:

• the function c \mapsto f(c) is onto (surjective);
• the function c \mapsto f(c) is one-to-one (injective);
• has a solution in Fq for each a in Fq;
• has a unique solution in Fq for each a in Fq.

A characterization of which polynomials are permutation polynomials is given by

(Hermite's Criterion) f ∈ Fq[x] is a permutation polynomial of Fq if and only if the following two conditions hold:

1. f has exactly one root in Fq;
2. for each integer t with 1 ≤ t ≤ q − 2 and t \not \equiv 0 !\pmod p, the reduction of f(x)t mod (x**q − x) has degree ≤ q − 2.

If f(x) is a permutation polynomial defined over the finite field GF(q), then so is for all a ≠ 0, b and c in GF(q). The permutation polynomial g(x) is in normalized form if a, b and c are chosen so that g(x) is monic, and (provided the characteristic p does not divide the degree n of the polynomial) the coefficient of is 0.

There are many open questions concerning permutation polynomials defined over finite fields.

Small degree

Hermite's criterion is computationally intensive and can be difficult to use in making theoretical conclusions. However, Dickson was able to use it to find all permutation polynomials of degree at most five over all finite fields. These results are:

A list of all monic permutation polynomials of degree six in normalized form can be found in .

Some classes of permutation polynomials

Beyond the above examples, the following list, while not exhaustive, contains almost all of the known major classes of permutation polynomials over finite fields.

• x**n permutes GF(q) if and only if n and q − 1 are coprime (notationally, ).
• If a is in GF(q) and n ≥ 1 then the Dickson polynomial (of the first kind) D**n(x,a) is defined by D_n(x,a)=\sum_{j=0}^{\lfloor n/2\rfloor}\frac{n}{n-j} \binom{n-j}{j} (-a)^j x^{n-2j}. These can also be obtained from the recursion D_n(x,a) = xD_{n-1}(x,a)-a D_{n-2}(x,a), with the initial conditions D_0(x,a) = 2 and D_1(x,a) = x. The first few Dickson polynomials are:
• D_2(x,a) = x^2 - 2a
• D_3(x,a) = x^3 - 3ax
• D_4(x,a) = x^4 - 4ax^2 + 2a^2
• D_5(x,a) = x^5 - 5ax^3 + 5a^2 x.

If a ≠ 0 and n 1 then D**n(x, a) permutes GF(q) if and only if . If then and the previous result holds.

• If GF(q**r) is an extension of GF(q) of degree r, then the linearized polynomial L(x) = \sum_{s=0}^{r-1} \alpha_s x^{q^s}, with αs in GF(q**r), is a linear operator on GF(q**r) over GF(q). A linearized polynomial L(x) permutes GF(q**r) if and only if 0 is the only root of L(x) in GF(q**r). This condition can be expressed algebraically as \det\left ( \alpha_{i-j}^{q^j} \right ) \neq 0 \quad (i, j= 0,1,\ldots,r-1).

The linearized polynomials that are permutation polynomials over GF(q**r) form a group under the operation of composition modulo x^{q^r} - x, which is known as the Betti-Mathieu group, isomorphic to the general linear group GL(r, Fq).

• If g(x) is in the polynomial ring Fq[x] and g(x**s) has no nonzero root in GF(q) when s divides q − 1, and r 1 is relatively prime (coprime) to q − 1, then x**r(g(x**s))(q - 1)/s permutes GF(q).
• Only a few other specific classes of permutation polynomials over GF(q) have been characterized. Two of these, for example, are: x^{(q + m - 1)/m} + ax where m divides q − 1, and x^r \left(x^d - a\right)^{\left(p^n - 1\right)/d} where d divides p**n − 1.

Exceptional polynomials

An exceptional polynomial over GF(q) is a polynomial in Fq[x] which is a permutation polynomial on GF(q**m) for infinitely many m.

A permutation polynomial over GF(q) of degree at most q1/4 is exceptional over GF(q).

Every permutation of GF(q) is induced by an exceptional polynomial.

If a polynomial with integer coefficients (i.e., in ℤ[x]) is a permutation polynomial over GF(p) for infinitely many primes p, then it is the composition of linear and Dickson polynomials. (See Schur's conjecture below).

Geometric examples

Main article: Oval (projective plane)

In finite geometry coordinate descriptions of certain point sets can provide examples of permutation polynomials of higher degree. In particular, the points forming an oval in a finite projective plane, PG(2,q) with q a power of 2, can be coordinatized in such a way that the relationship between the coordinates is given by an o-polynomial, which is a special type of permutation polynomial over the finite field GF(q).

Computational complexity

The problem of testing whether a given polynomial over a finite field is a permutation polynomial can be solved in polynomial time. For earlier research on this problem, see: {{cite journal

Permutation polynomials in several variables over finite fields

A polynomial f \in \mathbb{F}_q[x_1,\ldots,x_n] is a permutation polynomial in n variables over \mathbb{F}_q if the equation f(x_1,\ldots,x_n) = \alpha has exactly q^{n-1} solutions in \mathbb{F}_q^n for each \alpha \in \mathbb{F}_q.

Quadratic permutation polynomials (QPP) over finite rings

For the finite ring Z/nZ one can construct quadratic permutation polynomials. Actually it is possible if and only if n is divisible by p2 for some prime number p. The construction is surprisingly simple, nevertheless it can produce permutations with certain good properties. That is why it has been used in the interleaver component of turbo codes in 3GPP Long Term Evolution mobile telecommunication standard (see 3GPP technical specification 36.212 e.g. page 14 in version 8.8.0).

Simple examples

Consider g(x) = 2x^2+x for the ring Z/4Z. One sees:
so the polynomial defines the permutation \begin{pmatrix} 0 &1 & 2 & 3 \ 0 &3 & 2 & 1 \end{pmatrix} .

Consider the same polynomial g(x) = 2x^2+x for the other ring Z/8Z. One sees: so the polynomial defines the permutation \begin{pmatrix} 0 &1 & 2 & 3 & 4 & 5 & 6 & 7 \ 0 &3 & 2 & 5 & 4 & 7 & 6 & 1 \end{pmatrix} .

Rings Z/''p^k''Z

Consider g(x) = ax^2+bx+c for the ring Z/pkZ.

Lemma: for k=1 (i.e. Z/pZ) such polynomial defines a permutation only in the case a=0 and b not equal to zero. So the polynomial is not quadratic, but linear.

Lemma: for k1, p2 (Z/pkZ) such polynomial defines a permutation if and only if a \equiv 0 \pmod p and b \not \equiv 0 \pmod p.

Rings Z/''n''Z

Consider n=p_1^{k_1}p_2^{k_2}...p_l^{k_l}, where pt are prime numbers.

Lemma: any polynomial g(x) = a_0+ \sum_{0 defines a permutation for the ring Z/nZ if and only if all the polynomials g_{p_t}(x) = a_{0,p_t}+ \sum_{0 defines the permutations for all rings Z/p_t^{k_t}Z, where a_{j,p_t} are remainders of a_{j} modulo p_t^{k_t}.

As a corollary one can construct plenty quadratic permutation polynomials using the following simple construction. Consider n = p_1^{k_1} p_2^{k_2} \dots p_l^{k_l}, assume that k1 1.

Consider ax^2+bx, such that a= 0 \bmod p_1, but a\ne 0 \bmod p_1^{k_1}; assume that a = 0 \bmod p_i^{k_i}, i 1. And assume that b\ne 0 \bmod p_i for all . (For example, one can take a=p_1 p_2^{k_2}...p_l^{k_l} and b=1). Then such polynomial defines a permutation.

To see this we observe that for all primes pi, i 1, the reduction of this quadratic polynomial modulo pi is actually linear polynomial and hence is permutation by trivial reason. For the first prime number we should use the lemma discussed previously to see that it defines the permutation.

For example, consider Z/12Z and polynomial 6x^2+x. It defines a permutation \begin{pmatrix} 0 &1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & \cdots \ 0 &7 & 2 & 9 & 4 & 11 & 6 & 1 & 8 & \cdots \end{pmatrix} .

Higher degree polynomials over finite rings

A polynomial g(x) for the ring Z/pkZ is a permutation polynomial if and only if it permutes the finite field Z/pZ and g'(x) \ne 0 \bmod p for all x in Z/pkZ, where g′(x) is the formal derivative of g(x).

Schur's conjecture

Let K be an algebraic number field with R the ring of integers. The term "Schur's conjecture" refers to the assertion that, if a polynomial f defined over K is a permutation polynomial on R/P for infinitely many prime ideals P, then f is the composition of Dickson polynomials, degree-one polynomials, and polynomials of the form x**k. In fact, Schur did not make any conjecture in this direction. The notion that he did is due to Fried, who gave a flawed proof of a false version of the result. Correct proofs have been given by Turnwald and Müller.

Notes

References

• Chapter 7.
• Chapter 8.

References

1. "The graph structure of Chebyshev permutation polynomials over ring $Z\_\{p^k\}$". (2025). IEEE Transactions on Information Theory
2. "Permutation Polynomial Interleavers: An Algebraic-Geometric Perspective". (2006). IEEE Transactions on Information Theory
3. {{cite arXiv. "A New Construction for [[Low-density parity-check code". LDPC Codes]] using Permutation Polynomials over Integer Rings. (2005)
4. {{harvnb. Mullen. Panario. 2013
5. {{harvnb. Lidl. Niederreiter. 1997
6. {{harvnb. Lidl. Niederreiter. 1997
7. {{harvnb. Mullen. Panario. 2013
8. {{harvtxt. Lidl. Mullen. 1988
9. {{harvtxt. Lidl. Mullen. 1993
10. {{harvnb. Dickson. 1958
11. {{harvnb. Mullen. Panario. 2013
12. {{harvnb. Lidl. Mullen. 1988
13. {{harvnb. Lidl. Niederreiter. 1997
14. {{harvnb. Lidl. Niederreiter. 1997
15. {{harvnb. Lidl. Niederreiter. 1997
16. {{harvnb. Mullen. Panario. 2013
17. {{harvnb. Mullen. Panario. 2013
18. {{harvnb. Mullen. Panario. 2013
19. {{harvnb. Mullen. Panario. 2013
20. [http://www.3gpp.org/ftp/Specs/html-info/36212.htm 3GPP TS 36.212]
21. (2005). "Interleaver for Turbo Codes Using Permutation Polynomials Over Integer Rings". IEEE Transactions on Information Theory.
22. Fried, M.. (1970). "On a conjecture of Schur". Michigan Math. J..
23. Turnwald, G.. (1995). "On Schur's conjecture". J. Austral. Math. Soc..
24. Müller, P.. (1997). "A Weil-bound free proof of Schur's conjecture". Finite Fields and Their Applications.