Some Proposed Problems on Permutation Polynomials over Finite Fields

From the 19th century, the theory of permutation polynomial over finite fields, that are arose in the work of Hermite and Dickson, has drawn general attention. Permutation polynomials over finite fields are an active area of research due to their rising applications in mathematics and engineering. The last three decades has seen rapid progress on the research on permutation polynomials due to their diverse applications in cryptography, coding theory, finite geometry, combinatorics and many more areas of mathematics and engineering. For this reason, the study of permutation polynomials is important nowadays. In this chapter, we propose some new problems in connection to permutation polynomials over finite fields by the help of prime numbers.


Introduction to permutation polynomials
In this section, we collect some basic facts about permutation polynomials over a finite field that will be frequently used throught the chapter. First it will be convenient to define permutation polynomial over a finite field. Definition 1. A polynomial f x ð Þ ∈  q x ½ is said to be a permutation polynomial over  q for which the associated polynomial function c↦f c ð Þ ia a permutation of  q , that is, the mapping from  q to  q defined by f is one-one and onto.
Finite fields are polynomially complete, that is, every mapping from  q into  q can be represented by a unique polynomial over  q . Given any arbitrary function ϕ :  q !  q , the unique polynomial g ∈  q x ½ with deg g ð Þ < q representing ϕ can be found by the formula g x ð Þ ¼ P c ∈  q ϕ c ð Þ 1 À x À c ð Þ qÀ1 , see ( [1], Chapter 7).
Two polynomials represent the same function if and only if they are the same by reduction modulo x q À x, according to the following result. Lemma 1. [1] For f , g ∈  q x ½ we have f α ð Þ ¼ g α ð Þ for all α ∈  q if and only if f x ð Þ g x ð Þ mod x q À x ð Þ ð Þ . Due to the finiteness of the field, the followings are the equivalent conditions for a polynomial to be a permutation polynomial. Definition 2. The polynomial f ∈  q x ½ is a permutation polynomial of  q if and only if one of the following conditions holds: i. the function f : c↦f c ð Þ is onto; ii. the function f : c↦f c ð Þ is one-to-one; iii. f x ð Þ ¼ a has a solution in  q for each a ∈  q ; iv. f x ð Þ ¼ a has a unique solution in  q for each a ∈  q .

Criteria for permutation polynomials
Some well-known criteria for being permutation polynomials are the following.

First criterion for permutation polynomials
The first and in some way most useful, criterion was proved by Hermite for q prime and by Dickson for general q. This criterion has special name what is called Hermite's criterion.
Theorem 3 (Hermite's criterion ii. for each integer t with 1 ≤ t ≤ q À 2 and t not divisible by p, the residue For the detailed proof, one can see [1]. Above theorem is mainly used to show negative result. The following is a useful corollary for this purpose.
Corollary 4. There is no permutation polynomial of degree d dividing q À 1 over  q .
Proof. We note that deg f qÀ1 d ¼ q À 1. The proof follows from the last condition of Hermite's criterion. Remark 5. Hermite's criterion is interesting theoretically but difficult to use in practice.

Second criterion for permutation polynomials
Then f x ð Þ is a permutation polynomial of  q if and only if 0 ∉ D f ð Þ.

Third criterion for permutation polynomials
for all nontrivial additive characters χ of  q .
Then the polynomial f ∈  q x ½ is a permutation polynomial of  q if and only if for every nonzero η ∈  q , In what follows, we will discuss some well known classes of permutation polynomials which are commonly used.

Some well-known classes of permutation polynomials
In this subsection, several basic results on permutation polynomials are presented. Many times, we see that one of these general classes are obtained by simplifying complicated classes of permutation polynomials for proving their permutation nature.

Open problems on permutation polynomials
Very little is known concerning which polynomials are permutation polynomials, despite the attention of numerous authors. There are so many open problems and conjectures on permutation polynomials over finite fields but here we are listing few of them.
Open Problem 12. [2] Find new classes of permutation polynomials of  q . Although several classes of permutation polynomials have been found in recent years, but, an explicit and unified characterization of permutation polynomials is not known and seems to be elusive today. Therefore, it is both interesting and important to find more explicit classes of permutation polynomials.
Open Problem 13. [2] Find inverse polynomial of known classes of permutation polynomials over  q .
The construction of permutation polynomials over finite fields is an old and difficult problem that continues to attract interest due to their applications in various area of mathematics. However, the problem of determining the compositional inverse of known classes of permutation polynomial seems to be an even more complicated problem. In fact, there are very few known permutation polynomials whose explicit compositional inverses have been obtained, and the resulting expressions are usually of a complicated nature except for the classes of the permutation linear polynomials, monomials, Dickson polynomials.
Open Problem 14. [2] Find N d , where N d ¼ N d q ð Þ denote the number of permutation polynomials of degree d over  q .
To date, there is no method for counting the exact number of permutation polynomials of given degree. However, Koyagin and Pappalardi [3,4], found the asymptotic formula for the number of permutations for which the associated permutation polynomial has degree smaller than q À 2.

Applications of permutation polynomials
The study of permutation polynomials would not complete without mentioning their applications in other area of mathematics and engineering. It is a major subject in the theory and applications of finite fields. The study of permutation polynomials over the finite fields is essentially about relations between the algebraic and combinatoric structures of finite fields. Nontrivial permutation polynomials are usually the results of the intricate and sometimes mysterious interplay between the two structures. Here we mention some applications of permutation polynomials.

Coding theory
In coding theory, error correcting codes are fundamental to many digital communication and storage systems, to improve the error performance over noisy channels. First proposed in the seminal work of Claude Shannon [5], they are now ubiquitous and included even in consumer electronic systems such as compact disc players and many others. Permutation polynomials have been used to construct error correcting codes. Laigle-Chapuy [6] proposed a conjecture equivalent to a conjecture related to cross-correlation functions in coding theory. In [7], Chunlei and Helleseth derived several classes of p-ary quasi-perfect codes using permutation polynomials over finite fields. In 2005, Carlet, Ding and Yuan [8] obtained Linear codes using planar polynomials over finite fields.

Cryptography
The advent of public key cryptography in the 1970's has generated innumerable security protocols which find widespread application in securing digital communications, electronic funds transfer, email, internet transactions and the like. In recent years, permutation polynomials over finite fields has been used to design public key cryptosystem. Singh, Saikia and Sarma [9][10][11][12][13][14][15] designed efficient multivariate public key cryptosystem using permutation polynomials over finite fields. The same authors used a group of linearized permutation polynomials to design an efficient multivariate public key cryptosystem [16].
Permutation polynomials with low differential uniformity are important candidate functions to design substitution boxes (S-boxes) of block ciphers. S-boxes can be constructed from permutation polynomials over even characteristics [17] with desired cryptographic properties such as low differential uniformity and play important role in iterated block ciphers.

Finite geometry
Permutation polynomial f x ð Þ ∈  q x ½ is called a complete permutation polynomial if f x ð Þ þ x is also a permutation polynomial and an orthomorphism polynomial if f x ð Þ À x is also a permutation polynomial. Orthomorphism polynomials can be used in check digit systems to detect single errors and adjacent transpositions whereas complete permutation polynomials to detect single and twin errors. For more details on complete mappings and orthomorphisms over finite fields, we refer to the reader [3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19]. In addition, complete permutation polynomials are very useful in the study of orthogonal latin squares and orthomorphism polynomials are useful in close connection to hyperovals in finite projective plane. In 1968, planar functions were introduced by Dembowski and Ostrom [20] in context of finite geometry to describe projective planes with specific properties. Since 1991, planar functions have attracted interest also from cryptography as functions with optimal resistance to differential cryptanalysis.

Some proposed problems
Let  q denotes finite fields with q ¼ 2 m elements. Nowaday permutation polynomials are an interesting subject for study not for only research purposes but also for their various applications in many areas of mathematics and engineering. We refer [21] to the reader for recent advances and contributions to the area.
The rising applications of permutation polynomials in mathematics and engineering from last decade propels us to do new research. Recently, permutation polynomials with few terms over finite fields paying more attention due to their simple algebraic form and some extraordinary properties. We refer to the reader [22-25] for some recent developments. This motivates us to propose some new problems. In this chapter, by the help of prime numbers, we constructed several new polynomials that have no root in μ 2 m þ1 and two of them are generalizations of known ones. The constructed polynomials here may lay a good foundation for finding new classes of permutation polynomials.
Throughout the chapter, for a positive integer d, the set of d-th roots of unity in the algebraic closure  q of  q is denoted by μ d . That is, For every element x ∈  q , we denote x 2 m by x in analogous to the usual complex conjugation. Clearly, xx, x þ x ∈  q . Define the unit circle of  q as The  [23,25]. In next section, we also need the following definition.
Definition 15. Two polynomials are said to be conjugate to each other if one is obtained by raising 2 m -th power and multiplying them by the highest degree term of the other.
Next, we propose some new problems by reviewing various recent contributions. The polynomials that have no roots in μ 2 m þ1 play important role in theory of finite fields because these polynomials may give rise to a new class of permutation polynomials.
Let p ∈ 1, 2, … , 2 m À 1 f g , and let the binary representation of p be We define a polynomial function over  2 m as For example, We observe that there is a good connection between prime numbers and polynomials that have no roots in μ 2 m þ1 in the sense that most of these polynomials can be derived from prime numbers. In this way, for the prime numbers 11, 13 and 19 we get the polynomials L 11 x ð Þ, L 13 x ð Þ and L 19 x ð Þ respectively that have no roots in  Proof. Suppose α ∈ μ 2 m þ1 satisfies the equation Raising both sides of (1) to the 2 m -th power and multiplying by α 2nÀ1 , we get 1 þ α nÀ1 þ α 2nÀ1 ¼ 0: Adding (1) and (2), we get α nÀ1 þ α n ¼ 0 Since α 6 ¼ 0, which gives α ¼ 1. But α ¼ 1 does not satisfy (1), a contradiction. Hence 1 þ x n þ x 2nÀ1 has no roots in μ 2 m þ1 . Similarly, we can show that the polynomial 1 þ x n þ x 2nþ1 has no roots in μ 2 m þ1 .
In particular, we get the following lemma by Gupta and Sharma [22]. Based on the Lemma 5, we propose the following problem.
. Characterize n and r such that the polynomials x r h 1 x ð Þ 2 m À1 and x r h 2 x ð Þ 2 m À1 permutes μ 2 m þ1 . By the help of prime numbers below 1000, we obtain the following polynomials that have no roots in μ 2 m þ1 . Most of these polynomials are directly or indirectly associated with prime numbers in the sense that corresponding to either each polynomial or their conjugate polynomial, a prime number can be obtained. The proof of the following lemmas can be done in similar fashion as in [22].
Lemma 8. For a positive integer m, each of the polynomials  9 have no roots in μ 2 m þ1 .
The above list of polynomials are not complete. However, computational experiments shows that there should be more polynomials. A complete determination of all polynomials with few terms over finite fields seems to be out of reach for the time bing. Now, we are in condition to propose the following problem in connection to above three lemmas.