Dembowski-Ostrom polynomials and reversed Dickson polynomials
Neranga Fernando, Sartaj Ul Hasan, Mohit Pal

TL;DR
This paper classifies Dembowski-Ostrom polynomials formed from reversed Dickson polynomials and monomials over finite fields, analyzing their planarity using algebraic curve point bounds, with implications for cryptography and coding theory.
Contribution
It provides a classification of Dembowski-Ostrom polynomials from reversed Dickson polynomials and studies their planarity using a Weil bound variant.
Findings
Classification of Dembowski-Ostrom polynomials achieved
Identification of planar polynomials among them
Applications in cryptography and coding theory discussed
Abstract
We discuss the problem of classifying Dembowski-Ostrom polynomials from the composition of reversed Dickson polynomials of arbitrary kind and monomials over finite fields of odd characteristic. Moreover, by using a variant of the Weil bound for the number of points of affine algebraic curves over finite fields, we discuss the planarity of all such Dembowski-Ostrom polynomials. Planar Dembowski-Ostrom polynomials have applications in many areas including cryptography and coding theory.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Dembowski-Ostrom polynomials and reversed Dickson polynomials
Neranga Fernando
Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA 15213, USA
,
Sartaj Ul Hasan
Department of Mathematics, Indian Institute of Technology Jammu, Jammu 181221, India
and
Mohit Pal
Department of Mathematics, Indian Institute of Technology Jammu, Jammu 181221, India
Abstract.
We discuss the problem of classifying Dembowski-Ostrom polynomials from the composition of reversed Dickson polynomials of arbitrary kind and monomials over finite fields of odd characteristic. Moreover, by using a variant of the Weil bound for the number of points of affine algebraic curves over finite fields, we discuss the planarity of all such Dembowski-Ostrom polynomials. Planar Dembowski-Ostrom polynomials have applications in many areas including cryptography and coding theory.
Key words and phrases:
Finite fields, reversed Dickson polynomials, Dembowski-Ostrom polynomials, planar functions
2010 Mathematics Subject Classification:
12E20, 11T55, 05A10, 11T06
1. Introduction
Denote, as usual, by the finite field with elements, where is an odd prime number and is a positive integer, and by the multiplicative group of non-zero elements of . For any nonnegative integer , the -th Dickson polynomial of the first kind over was introduced by Dickson [7] in 1897, and is defined as follows
[TABLE]
where is a parameter and . More than two decades later, Schur [21] introduced a variant of Dickson polynomial of the first kind in 1923, which is now known as Dickson polynomial of the second kind. For any nonnegative integer , the -th Dickson polynomial of the second kind over is defined as follows
[TABLE]
where is a parameter and . A trigonometric approach for Dickson polynomials has been recently considered by Lima and Panario [15]. Dickson polynomials have also been used to study the -differential uniformity of some functions over finite fields [10]. Dickson polynomials of the first and second kind over were studied extensively, especially with respect to their permutation behaviour. We recall that a polynomial is a permutation polynomial over if the associated mapping is a bijection from to . For a non-zero element in , Nöbauer [17] proved that the Dickson polynomial of the first kind permutes the elements of if and only if However, except for a few cases, the permutation behaviour of Dickson polynomials of the second kind remains unresolved. One may refer to the monograph [13] for more on Dickson polynomials.
The notion of -th reversed Dickson polynomial (RDP) of the first kind was introduced by Hou, Mullen, Sellers and Yucas [12] by simply reversing the roles of the variable and the parameter in the -th Dickson polynomial of the first kind . Moreover, the authors showed that the reversed Dickson polynomials of the first kind are closely related to what are known as almost perfect nonlinear (APN) functions. The permutation behaviour of RDPs is also an interesting area of research. Hou and Ly [11] gave necessary conditions for RDPs of the first kind to be permutation polynomials over .
For any nonnegative integers and , the notion of -th Dickson polynomial of the -th kind, denoted as , was introduced by Wang and Yucas [22], and is defined as follows
[TABLE]
where , and . The -th RDP of the -th kind is also defined in a similar way by just reversing the role of the variable and the parameter in (1.1). More precisely, for any nonnegative integers and , the -th RDP of the -th kind is defined as follows
[TABLE]
where , and . The -th RDP of the -th kind also satisfies the following recurrence relation
[TABLE]
It may be noted that the permutation behaviour of RDPs of the -th kind has been studied by Fernando [8].
A function is called planar if the mapping induces a bijection from to for each Since any function from a finite field to itself can be represented by a polynomial of degree at most , one may simply consider the planarity of polynomials over finite fields. It is clear from the definition of a planar function itself that there is no planar function in the even characteristic as and have the same image under the mapping A polynomial is called exceptional planar if it is planar over for infinitely many . Planar functions are very important due to their wide range of applications. For example, planar functions are used to construct finite projective planes [6], relative difference sets [9] and error-correcting codes [2].
A Dembowski-Ostrom (DO) polynomial over finite field is a polynomial that admits the following shape
[TABLE]
where . DO polynomials have been used in designing a public key cryptosystem known as HFE [18]. Note that DO polynomials provide a very rich source of planar functions. It was conjectured by Rónyai and Szönyi [20] (see also [16, Conjecture 9.5.19]) that all planar functions are of “DO type”. This conjecture is still open except in the case of characteristic for which a counter example was given by Coulter and Matthews [4]. In 2010, Coulter and Matthews [5] classified DO polynomials from Dickson polynomials of the first and second kind and they also discussed the planarity of such DO polynomials.
In 2016, Zhang, Wu and Liu [24] classified DO polynomials from RDPs of the first kind in the even characteristic case and they also characterized APN functions among all such DO polynomials. In this paper, we shall extend the results of Zhang, Wu and Liu [24] to the odd characteristic case. In fact, we give a complete classification of DO polynomials arising from the composition of RDPs of the -th kind and the monomial , where is a positive integer, in odd characteristic, and we further characterize planar functions among these DO polynomials. The motivation behind considering this composition actually stems from the known fact that the exceptional planar polynomials are essentially the composition of the Dickson polynomials and the monomial . DO polynomials do not have any constant term. We shall, therefore, consider the polynomials for the purpose of classifying DO polynomials. Notice that is given by
[TABLE]
For the sake of simplicity, we shall denote , , , , and by , , , and , respectively. The paper has been organized as follows. In Section 2, we state some lemmas that will be used in the subsequent sections. In Sections 3, 4, 5 and 6, we classify DO polynomials from , , and , respectively. The case has been considered in Section 7. In Section 8, we consider the planarity of DO polynomials obtained in the previous sections. The complete list of DO polynomials derived from reversed Dickson polynomials is given in Appendix A.
Throughout the paper, we always assume that is an odd prime, is a positive integer, and are nonnegative integers unless specified otherwise. The greatest common divisor of positive integers and is denoted by .
2. Some useful lemmas
As alluded earlier, we shall first classify DO polynomials derived from the composition of RDPs of the -th kind and the monomial , where is a positive integer. Since DO polynomials are closed under the composition with the monomial , it would be sufficient to consider the cases when . One may also note that the monomial , where is positive integer, is a DO monomial if and only if for some nonnegative integers and . Here, is the highest exponent of such that . It is obvious that whenever , we must have . In what follows, we shall invoke these assumptions and conventions as and when required.
We now present some lemmas which will be useful in the sequel.
Lemma 2.1**.**
Let be a positive integer and be a prime such that . Assume that the coefficients of and in the polynomial are non-zero. Then the polynomial is not a DO polynomial.
Proof.
Assume that and the coefficients of and in the polynomial are non-zero. Therefore, if is a DO polynomial then and . Thus, we have , which is true if and only if , and . This is a contradiction to our assumption that , hence is not a DO polynomial. ∎
Lemma 2.2**.**
Let be a positive integer and be a prime such that . Assume that the coefficients of and in the polynomial are non-zero. Then the polynomial is not a DO polynomial.
Proof.
The proof follows using a similar reasoning as in the proof of Lemma 2.1. ∎
Lemma 2.3**.**
Let be a positive integer and be an odd prime such that . Assume that the coefficients of and in the polynomial are non-zero. Then the polynomial is not a DO polynomial.
Proof.
The proof is along the similar line as in the proof of Lemma 2.1. ∎
Lemma 2.4**.**
Let and be a positive integer such that . Assume that the coefficients of and in the polynomial are non-zero. Then the polynomial is not a DO polynomial.
Proof.
The proof follows by using a similar argument as in Lemma 2.1. ∎
Now we recall the following lemma from [14, Proposition 6.39], which will be used later.
Lemma 2.5**.**
(Legendre’s formula) For any nonnegative integer and any prime , the largest exponent of that divides is given by
[TABLE]
where is the sum of the digits in the representation of to the base .
3. DO polynomials from RDPs of the first kind
Before we begin the classification of DO polynomials from RDPs of the first kind, we shall slightly deviate and prove the following proposition that readily gives DO polynomials arising from RDPs of the -th kind when the parameter is zero.
Proposition 3.1**.**
The polynomial is DO if and only if is even, and is of the form , where .
Proof.
We know that
[TABLE]
Clearly, is a DO polynomial if and only if is even, and ∎
In view of Proposition 3.1, we shall assume that is non-zero for the rest of the paper.
We now consider RDPs of the first kind.
For , we write with an indeterminate . Then
[TABLE]
see [8, Section 2]. Also, we have . Since and , we have , where
[TABLE]
Since , it would be sufficient to consider the cases when . The following theorems give a complete classification of DO polynomials from polynomial for odd and even, respectively.
Theorem 3.2**.**
Let be a power of an odd prime , and odd. The polynomial is a DO polynomial over if and only if one of the following holds.
- (i)
, , , where . 2. (ii)
, , , where .
Proof.
The sufficiency of the theorem is straightforward. It only remains to show the necessity. Notice that when is odd, then
[TABLE]
Since , the first term in will always exist. Thus, if is a DO polynomial then . Since , we have . Therefore, we shall always take . Now we consider two cases, and .
Case 1. Let . In this case, the coefficient of the second term in (3.1) is non-zero. Therefore, if is a DO polynomial, then and . Since is odd and , . Hence, the first equation reduces to . Combining these two equations, we obtain , which is true if and only if , , and . Therefore, in this case, we shall always assume that and . For and , the polynomials and are clearly DO polynomials. Now we claim that when and is odd, is never a DO polynomial. Since , we have only two cases to consider, namely, and .
In the case , consider the second last term in (3.1) which is given by If the coefficient of the second last term in (3.1) is non-zero, then we claim that cannot be written as for some nonnegative integers and . On the contrary assume that , which implies . Since , if and only if . But implies , which is a contradiction to our assumption that . Therefore is not a DO polynomial in this case.
Now assume that the coefficient of the second last term in (3.1) is zero. In this case, we shall show that the fourth term always exists. Note that the fourth term contains the monomial whose exponent cannot be written as for some nonnegative integers and . The coefficient of the fourth term is given by
[TABLE]
Since , and . Since , where is odd and greater than , is a multiple of 24, i.e. , where is an integer. Then the coefficient of the fourth term in (3.2) becomes .
Now we show that . On the contrary, assume that . Then we have, for some integer . Since , write for some integer . Recall that the second last term in (3.1) vanishes. By substituting for in the coefficient of the second last term, we obtain . Let for some integer . Then . From and , we have , which is a contradiction. Therefore, our assumption that is wrong, and hence the coefficient of is non-zero. Therefore, when the second last term in (3.1) vanishes, is not a DO polynomial.
In the case , we first look at the fourth term. Recall that the fourth term contains the monomial whose exponent cannot be written as for some nonnegative integers and . If the coefficient of the fourth term given in (3.2) is non-zero, then clearly is not a DO polynomial. In the case of the coefficient of the fourth term is zero, we claim that the coefficient of the 7th term, which contains the monomial , is non-zero. The coefficient of the 7th term is given by
It is clear that the exponent of the monomial cannot be written as for some nonnegative integers and . Since is odd and , it is clear that , , and . Also, , , , and . Therefore, the coefficient of the 7th term is non-zero. Hence, in the case of the coefficient of the fourth term is zero, is not a DO polynomial.
Case 2. Let . In this case, notice that if , then , which is a contradiction as . Therefore we shall assume that . For , the polynomial is a DO polynomial if and only if . For , consider the third term in (3.1), which contains the monomial . Since , . Hence the coefficient of the third term is non-zero. Thus, if is a DO polynomial, then and . Combining these two equations, we have , which is true if and only if , , and . Notice that the coefficient of last term in (3.1), which contains the monomial , is non-zero. Thus, if is a DO polynomial then . Since , , and hence . Also, notice that if then , which is a contradiction as . Therefore which implies that , a contradiction as . Therefore for , is never a DO polynomial. This completes the proof. ∎
Theorem 3.3**.**
Let be a power of an odd prime , and even. The polynomial is a DO polynomial over if and only if one of the following holds.
- (i)
, , where . 2. (ii)
, , , where .
Proof.
The sufficiency of the theorem is straightforward. It only remains to show the necessity. Notice that when is even, then
[TABLE]
Since , the first term in will always exist. Thus, if is a DO polynomial, then . Since , we have . Therefore, we shall always take . When , the polynomials is clearly a DO polynomial. For , we consider two cases, and .
Case 1. Let . In this case, the coefficient of the second term in (3.3), which contains the monomial , is non-zero. Thus, if is a DO polynomial, then and . Since is odd and , we have . Combining these two equations, we obtain and . Therefore in what follows, we shall take and . In the case , the polynomial is clearly DO polynomial.
Now for , even and , we claim that is not a DO polynomial. Consider the fourth term, which contains the monomial . It is clear that cannot be written as for some nonnegative integers and . If the coefficient of the fourth term in (3.2) is non-zero, then is not a DO polynomial. Now consider the case where the coefficient of the fourth term is zero. Note that the coefficient of the last term in (3.3), which contains the monomial , is always non-zero. Thus, if is a DO polynomial, then Clearly, , otherwise , a contradiction. If , then . Now consider the second last term in (3.3), which contains the monomial . Clearly, the coefficient is non-zero as . If is a DO polynomial and , then . If then , which is a contradiction since . If , then . This contradicts the assumption that . Thus is not a DO polynomial in this case.
Case 2. Let . In this case, if , then , which is a contradiction as . Therefore, we shall always consider . Notice that the coefficient of the last term in (3.3), which contains the monomial , is non-zero. Thus, if is a DO polynomial, then and . Since and , . Hence, the first equation reduces to . Combining these two equations, we get . If , then , which implies or depending on whether or , respectively, a contradiction. If , then , otherwise , which is a contradiction as . Therefore , a contradiction. This completes the proof. ∎
4. DO polynomials from RDPs of the second kind
Recall that is denoted by , where
[TABLE]
The following theorems give necessary and sufficient conditions for RDPs of the second kind to be DO polynomials for and , respectively.
Theorem 4.1**.**
Let be a power of the odd prime and . The polynomial is a DO polynomial over if and only if one of the following holds.
- (i)
* and , where * 2. (ii)
* and , where .* 3. (iii)
* and , where .* 4. (iv)
* and , where .*
Proof.
The sufficient part of the theorem is straightforward, therefore, we only prove the necessary part. If the polynomials and are DO polynomial, then is of the form . Similarly, the polynomial is a DO polynomial only if is of the form . If the polynomial is a DO polynomial, then and . Since , . Therefore, is a DO polynomial only if is of the form . The polynomial is a DO polynomial only if and . Since , . Combining these two equations, we obtain , and . For , we shall treat all possible cases depending on the value of modulo .
Case 1. Let . In this case, , therefore, and hence the coefficient of in (4.1), is non-zero. Now, consider the fourth term
[TABLE]
It is clear that , and . Also, since , , and hence the highest exponent of which divides the numerator of the coefficient of fourth term is . By Lemma 2.5, the highest exponent of which divides is . Therefore, coefficient of the fourth term is non-zero and is not a DO polynomial by Lemma 2.4.
Case 2. Let . In this case, and hence, the coefficient of in (4.1) is non-zero. Now consider the fourth term as given in (4.2) again. Following similar arguments as in the Case 1 above, it is easy to see that the coefficient of the fourth term is nonzero and hence is not a DO polynomial by Lemma 2.4.
Case 3. Let . In this case, if the polynomial is a DO polynomial, then , and . Since , . Combining the first two equations, we obtain , and . Now, putting these values in third equation, we have and . Similarly, if the polynomial is a DO polynomial, then , , and . Since and , we have and . Combining first, second and fourth equation, we obtain , and . Now, putting these values in third equation, we have and . For , since , , and hence the coefficient of is non-zero. Now, consider the th term
[TABLE]
By Lemma 2.5, the highest exponent of that divides is . In the numerator of the coefficient of th term, and . Now, if , then the highest exponent of which divides the numerator is . Hence the coefficient of is non-zero. Thus, if is a DO polynomial then and . Combining these equations, we have , which forces and , a contradiction. Therefore, is not a DO polynomial in this case. In the case , we have . In this case, consider the th term
[TABLE]
The arguments of Case 1 can be invoked here to shows that the coefficient of is non-zero. Thus, if is a DO polynomial, then and . Combining these equations, we have , which forces and , a contradiction. Therefore, is not a DO polynomial in this case.
Case 4. Let . In this case, if the polynomial is a DO polynomial, then , and . Since , . Combining these equations, we obtain , and . Now, for , since , we have , and hence the coefficient of in (4.1) is non-zero. Now, consider the th term as given in (4.3). By Lemma 2.5, the highest exponent of that divides is . In the numerator of the coefficient of th term, and . Now if , then the highest exponent of which divides the numerator is . Hence the coefficient of is non-zero. Thus if is a DO polynomial, then and . Combining these two equations, we have , which forces and , a contradiction. Therefore is not a DO polynomial in this case. In the case , is equivalent to . In this case, consider the th term as given in (4.4). By similar arguments as in the Case 1 one may prove that the coefficient of is non-zero. Therefore, if is a DO polynomial, then and . Combining these equations, we have , which forces and , a contradiction. Therefore is not a DO polynomial in this case.
Case 5. Let . In this case, if the polynomial is a DO polynomial, then , and . Since , . Combining the first two equations, we obtain , and . Now putting these values in third equation, we have , a contradiction. Therefore, is not a DO polynomial. Now, for , consider the th term
[TABLE]
By Lemma 2.5, the highest exponent of that divides is . In the numerator of the coefficient of th term, and . Now if , then the highest exponent of which divides the numerator is . Hence the coefficient of is non-zero. Thus if is a DO polynomial, then and . Combining these equations, we get , which forces and , a contradiction. Therefore is not a DO polynomial in this case. In the case , is equivalent to . Now, consider the th term
[TABLE]
By way of similar arguments as done in Case 1, the coefficient of is non-zero. Thus, if is a DO polynomial, then and . Combining these equations, we get , which forces and , a contradiction. Therefore is not a DO polynomial in this case.
Case 6. Let . In this case, if the polynomial is a DO polynomial, then , and . Since , . Combining these equations, we obtain , and . Now, for , consider the th term as given in (4.5). One may follow the similar arguments of Case 5 above to shows that if , the coefficient of is non-zero. Therefore is not a DO polynomial in this case. In the case , is equivalent to . In this case, consider the th term as given in (4.6). Similar arguments as in the Case 1 show that the coefficient of is non-zero. Therefore is not a DO polynomial in this case.
Case 7. Let . In this case is equivalent to . Also, since , we have and hence the coefficient of in (4.1) is non-zero. Now consider the th term, which is given by
[TABLE]
By following similar arguments as in the Case 1, it is not difficult to prove that the coefficient of is non-zero. Thus, if is a DO polynomial, then and . Combining these equations, we have , which forces and , a contradiction. Therefore is not a DO polynomial in this case. This completes the proof. ∎
Theorem 4.2**.**
Let be a power of an odd prime and . The polynomial is a DO polynomial over if and only if one of the following holds.
- (i)
* and , where * 2. (ii)
, and , where .
Proof.
It is enough to prove the necessary part. If the polynomials and are DO polynomial, then is of the form . By Lemma 2.1, the polynomials and are not DO polynomials. The polynomial is a DO polynomial only if and . Combining these equations, we get , which forces , , a contradiction. Therefore, is not a DO polynomial. For the polynomial , we consider two cases, namely, and . For , if is a DO polynomial, then and . Combining these equations, we have , which forces , and . For , . Since the coefficients of and are non-zero, Lemma 2.1 confirms that is not a DO polynomial. For , we shall consider four cases, namely, , , and , respectively.
Case 1. Let . In this case, the coefficients of and in (4.1) are non-zero, therefore is not a DO polynomial by Lemma 2.1.
Case 2. Let . In this case, we have . Therefore, the coefficients of and in (4.1) are non-zero. Thus, if is a DO polynomial, then and . Combining these equations, we have , which forces and , a contradiction. Therefore is not a DO polynomial.
Case 3. Let . In this case, the coefficient of the first term in (4.1), which contains the monomial , is non-zero. Now we consider two cases, namely, and . In the case , is equivalent to . We now show that if , then the sixth term exists whose coefficient is given by Since , we have . Also, if , then the highest exponent of which divides the numerator is 1. By Lemma 2.5, the highest exponent of that divides is 1. Therefore the coefficient of is non-zero. Thus, if is a DO polynomial, then and . Combining these equations, we have , which forces and , a contradiction. Therefore is not a DO polynomial in this case. Now if , then the condition is equivalent to . In this case, using the similar arguments, we can show that the coefficient of is non-zero. Thus, if is a DO polynomial, then and . Combining these equations, we have , which forces and , a contradiction. Therefore is not a DO polynomial in this case. In the case , since , we have . Hence the coefficients of and in (4.1) are non-zero, therefore is not DO polynomial by Lemma 2.2.
Case 4. Let . In this case, the first term in (4.1) does not vanish. Now we consider two cases, namely, and . In the case , since , we have , and hence the fourth term as given in (4.2) does not vanish. Therefore, if is a DO polynomial, then and . Combining these equations, we have , which forces and , a contradiction. Therefore is not a DO polynomial in this case. In the case , since , we have . Therefore, the fourth term as given in (4.2) and the fifth term whose coefficient is given by do not vanish. Thus, if is a DO polynomial, then , and . Combining the first two equations, we have , which forces , , and . Now putting these values in third equation, we have , a contradiction. Therefore is not a DO polynomial in this case. This completes the proof. ∎
One may recall from [22, Theorem 3.1] that RDPs of the second kind and RDPs of the third kind admit the following relationship
[TABLE]
Thus, it is obvious that is a DO polynomial whenever is a DO polynomial. Consequently, the classification of DO polynomials from RDPs of the third kind follows immediately. In view of this, we shall consider RDPs of the fourth kind in the next section.
5. DO polynomials from RDPs of the fourth kind
Recall that is denoted by , where
[TABLE]
Also, from (1.3), it is easy to see that . Therefore, for , is a DO polynomial whenever is a DO polynomial and the classification of DO polynomials from has already been discussed in Section 3. Therefore, throughout this section, we consider . The following theorem gives a complete classification of DO polynomials derived from .
Theorem 5.1**.**
Let be a power of an odd prime and . The polynomial is a DO polynomial over if and only if one of the following holds.
- (i)
* and , where .* 2. (ii)
, and , where .
Proof.
It is enough to prove only the necessary part. If the polynomial is a DO polynomial, then . The polynomial is the zero polynomial and hence it is not a DO polynomial. The polynomials , and are not DO polynomials by Lemma 2.1. In the case of the polynomial , we consider two cases, namely, and . In the case , if is a DO polynomial, then and . Combining these equations, we have , which is true if and only if , and . When , is not a DO polynomial by Lemma 2.2. For , we consider two cases, namely, and .
Case 1. Let . Note that when , the coefficients of and in are non-zero. Therefore, is not a DO polynomial by Lemma 2.1. In the case , the coefficient of is non-zero and also, the coefficient of in , given by is non-zero. Therefore, is not a DO polynomial by Lemma 2.3. When , the coefficients of and in are non-zero, therefore, is not a DO polynomial by Lemma 2.2.
Case 2. Let . Notice that when , the coefficients of and in are non-zero, therefore is not a DO polynomial by Lemma 2.1. In the case , the coefficients of and in are non-zero, therefore is not a DO polynomial by Lemma 2.3. For , if the polynomial is a DO polynomial, then , and . Since , . Thus, by combining these equations, we obtain , and . For , since , we have and hence the coefficient of in is non-zero. Now consider the th term whose coefficient is given by By Lemma 2.5, the highest exponent of which divides is . Also, if , then highest exponent of that divides the numerator of coefficient of is , hence the coefficient of is non-zero. Thus, if is a DO polynomial, then and . Combining these equations, we get , which forces and , a contradiction. Thus is not a DO polynomial in this case. In the case , consider the th term whose coefficient is given by It is easy to verify that the coefficient of is non-zero. Thus, if is a DO polynomial, then and . Combining these equations, we have , which forces and , a contradiction. Thus is not a DO polynomial in this case. ∎
6. DO polynomials from RDPs of the fifth kind
Here we consider RDPs of the fifth kind. Recall that is denoted by , where
[TABLE]
It is easy to see from (1.3) that , thus for , is a DO polynomial whenever is a DO polynomial. Thus, throughout this section, we take .
Theorem 6.1**.**
Let be a power of an odd prime and . The polynomial is a DO polynomial over if and only if one of the following holds.
- (i)
* and , where .* 2. (ii)
* and , where .*
Proof.
The sufficiency of the theorem is straightforward. It only remains to show the necessity. If the polynomials and are DO polynomials, then . Similarly, if the polynomial is a DO polynomial, then . In the case of polynomials , and , the coefficients of and are non-zero. Therefore, , and are not DO polynomials by Lemma 2.1. The polynomial is not a DO polynomial by Lemma 2.3. If the polynomial is a DO polynomial, then and . Combining these equations, we get , which forces , , a contradiction. Thus is not a DO polynomial. For , we consider two cases, and .
Case 1. Let . Notice that when , the coefficients of and in are non-zero, therefore, is not a DO polynomial by Lemma 2.1. In the case , the coefficients of is clearly non-zero and also, the coefficient of in given by is non-zero. Thus, if is a DO polynomial, then and . Combining these equations, we have , which forces and , a contradiction. Thus is not a DO polynomial in this case. When , the coefficient of in is non-zero. Also, if , the coefficient of in given by is non-zero. Thus, if is a DO polynomial, then and . Since , and hence, the second equation reduces to . Combining these equations, we have , which forces and , a contradiction. Thus is not a DO polynomial. In the case , the condition is equivalent to . Now consider the th term whose coefficient is given by Since , we have . Hence the highest exponent of , which divides the numerator is . By Lemma 2.5, highest exponent of , which divides is . Therefore, the coefficient of is non-zero. Thus, if is a DO polynomial, then and . Combining these two equations, we have , which forces and , a contradiction. Thus is not a DO polynomial.
Case 2. Let . Notice that when , the coefficients of and in are non-zero, therefore is not a DO polynomial by Lemma 2.1. In the case , the coefficients of and in are non-zero, therefore is not a DO polynomial by Lemma 2.2. When , the coefficients of and in are non-zero. Thus, if is a DO polynomial, and . Combining these equations, we have , which forces and , a contradiction. Thus, is not a DO polynomial. This completes the proof. ∎
7. The case
For , we shall classify DO polynomials from the polynomial , where
[TABLE]
From (1.3), it is straightforward to see that for , , whenever , respectively. Similarly, for , , whenever , respectively. Thus the only cases that remain to be considered are and for which we have the following theorem.
Theorem 7.1**.**
Let be a power of an odd prime and . The polynomial where is a DO polynomial over if and only if one of the following holds.
- (i)
* and , where .* 2. (ii)
, and , where . 3. (iii)
, and , where .
Proof.
Only sufficiency of the theorem is required to be proved. If the polynomials and are DO polynomials, then is of the form . The polynomial is not a DO polynomial by Lemma 2.1. In the case of the polynomial , we consider three cases, namely, , and . In the case , if is a DO polynomial, then is of the form . When and if is a DO polynomial, then is of the form . In the case , is not a DO polynomial by Lemma 2.1. For , we consider four cases, namely, , , and .
Case 1. Let . In this case, the coefficients of and in are non-zero, and therefore is not a DO polynomial by Lemma 2.1.
Case 2. Let . In this case, we have . Also, note that , otherwise . Similarly, , otherwise . Therefore, the coefficients of and in are non-zero and hence is not a DO polynomial by Lemma 2.2.
Case 3. Let . Notice that . Also, note that , otherwise . Therefore, the coefficient of in is non-zero. Also, when , the coefficient of in is non-zero. Thus, if is a DO polynomial, then and . Combining these equations, we get , which forces and , a contradiction. Therefore, is not a DO polynomial in this case. In the case , consider the coefficient of the fifth term Since , we have . Also, note that , otherwise . Therefore, the coefficients of and in are non-zero. Thus, if is a DO polynomial, then and . Combining these equations, we get , which forces and , a contradiction. Therefore, is not a DO polynomial.
Case 4. Let . Notice that , otherwise . Therefore the coefficient of in is non-zero. Also note that and , otherwise and , respectively. When , the coefficient of in is non-zero and hence is not a DO polynomial by Lemma 2.2. In the case , the condition is equivalent to . Now consider the fifth term again. By similar arguments as done in Case 3 above, it is easy to see that the coefficient of is non-zero. Thus, if is a DO polynomial, then and . Combining these equations, we get , which forces and , a contradiction. Therefore is not a DO polynomial. This completes the proof. ∎
8. Discussion on planarity
We consider the planarity of DO polynomials obtained from RDPs of the -th kind as listed in the Appendix A. First, we shall discuss the tools and techniques that are needed to understand the planarity of DO polynomials. These tools and techniques are similar to the ones used in [5]. Recall that a polynomial function is said to be planar if the difference function permutes the elements of for each . If happens to be a DO polynomial, the difference function for each , belongs to another well-known class of polynomials called linearized polynomials. Therefore, a DO polynomial is planar if and only if the linearized polynomial is a permutation polynomial for each . The permutation behaviour of linearized polynomial is well-known. In fact, [14, Theorem 7.9] tells us that a linearized polynomial is a permutation polynomial over if and only if its only root in is [math]. Therefore, in order to show that a DO polynomial is not planar, it is sufficient to show that the difference function has a root in .
We recall that a DO polynomial function from to itself is called 2-to-1 function if the cardinality of the image set on is Qiu et al. [19] showed that the size of the image set on of a planar polynomial over must be at least For a DO polynomial , Weng and Zeng [23, Theorem 2.3] gave the following necessary and sufficient condition for to be planar.
Lemma 8.1**.**
Let be a DO polynomial over . Then is planar if and only if is 2-to-1.
Lemma 8.1 has further consequences. First, if a DO polynomial has a root , then is also a root of . Therefore, the cardinality of image set of on is strictly less than and hence, in such a case, is not planar.
For the second consequence, we begin with an easy observation that if is a DO polynomial, then so is . We know that is a linearized permutation polynomial over . Therefore, the cardinality of the image set of and on is same. Hence if is planar, then is also planar. Therefore in such situations, it would be sufficient to consider the planarity of .
Another important tool that we would require to study the planarity of DO polynomials is the following version of Weil bound as stated in [3, Lemma 2.4].
Lemma 8.2**.**
Let be an absolutely irreducible polynomial in . Then the number of with satisfies
[TABLE]
where is the total degree of .
We now describe the strategy for using the Weil bound to determine the planarity of certain DO polynomials. Let be a DO polynomial over and consider the difference function . If this difference function has an absolutely irreducible factor, say , of total degree , then Lemma 8.2 gives a lower bound for the cardinality of all the points such that . If the degree of the absolutely irreducible factor is not too large and is large enough, then we have many -rational points on the affine algebraic curve defined by . Moreover, if is strictly larger than the number of solutions to with either or , then Lemma 8.2 yields the existence of a point in such that and hence, for such a point, we have , i.e, has a root in . Thus, in order to show that is not exceptional planar (i.e., planar over infinitely many extensions of ), it is sufficient to show that the difference function of contains an absolutely irreducible component with a solution in .
It is straightforward to see that for , RDPs of the -th kind admit the following relationship
[TABLE]
In view of (8.1), and due to the fact that the planarity property of a function remains invariant under linear transformations (i.e. if is planar so is with ), we have the following lemma.
Lemma 8.3**.**
Let be the -th RDP of the -th kind. Then is planar equivalent over to for any .
Over the algebraic closure of , we derive a useful consequence of Lemma 8.3. Note that one may always choose that satisfies the equation . In this way the factorizations of and over are linearly related. As a consequence, the absolutely irreducible factors of are of the same form for all non-zero . Thus, without loss of generality, one may always take , while checking the absolute irreducibility of certain polynomials.
Now we consider the planarity of the DO polynomials listed in the Appendix A in three different cases.
Case 1. Let . The planarity of monomials , , , , and is well-known by [4, Theorem 3.3] and these monomials are planar over if and only if is odd. It is easy to see that is a root of the polynomials , , , and . Therefore, these DO polynomials are not planar. Now we consider the planarity of the rest of the DO polynomials one by one.
(i) In the case of binomial , consider the difference function where , which is simply an irreducible conic since is non-zero. Therefore, by Lemma 8.2, the number of with is greater than or equal to . Note that we can obtain at most solutions to by putting either or . Therefore, when , there must exist a root of . Therefore, is not planar when , i.e., . For , which is clearly a planar function.
(ii) The DO binomial can be written as composition of a linearized polynomial and a monomial as . Now from [4, Theorem 2.3], is planar if and only if is a permutation polynomial and is planar. Now, since is a root of the linearized polynomial , is not a permutation polynomial. Hence, is not planar.
(iii) In the case of the DO polynomial , consider the difference function where The Magma algebra package [1] reveals that is absolutely irreducible. Therefore, by Lemma 8.2, the number of solutions of satisfies Now have in total solutions in . Similarly, have in total solutions in . Therefore, in total solutions can be obtained either by putting or . Now if , i.e., then possesses a solution . This is true for , therefore, for , is not planar. For , which is clearly a planar polynomial. Computations show that for , the cardinality of the image set of on is strictly less than . Therefore, by Lemma 8.1, is not planar in these cases.
(iv) Consider the DO polynomial This polynomial is never planar over when is even. Since in this case , the cardinality of image set of on is at most and thus, by Lemma 8.1, is not planar. When is odd, we consider the difference function where
[TABLE]
Again, the Magma algebra package [1] shows that the polynomial obtained from by putting , is absolutely irreducible. Therefore, by Lemma 8.2, the number of solutions of satisfies . Also, and this has no root in odd degree extensions of . Similarly, has no root in odd degree extensions of . Therefore, there is no solution to corresponding to . If , then has a root This holds true for all . Therefore, is not planar over for . In the case , the polynomial which is clearly a planar function. Computations show that for , the cardinality of the image set of on is strictly less than , therefore, is not planar in these cases. In the case , is planar for every choice of .
Case 2. Let . The planarity of DO monomials , , , , , , , and is well-known by [4, Theorem 3.3] and these monomials are planar over whenever is odd. It is straightforward to see that is a root of the DO binomial and hence, it is not planar. Now we consider the planarity of the rest of the DO polynomials one by one.
(i) For the DO binomial , consider the difference function where . It is easy to see that and has no repeated roots. Therefore, by Eisenstein’s criterion, is absolutely irreducible. Thus, by Lemma 8.2, the number of solutions of satisfies Now, at most roots of can be obtained by putting either or . Therefore, if , will have a solution , which holds for all . Therefore, is not planar over for . When , which is clearly a planar function. For , the number of solutions of the equation in is 40, which is greater than 16. Therefore, is not planar in this case.
(ii) In the case of the DO trinomial consider the difference function where The Magma algebra package [1] shows that is absolute irreducible. Therefore, by Lemma 8.2, the number of solutions of satisfies . Now, can have at most solutions. Similarly, can have at most solutions. Therefore, at most solutions can be obtained by putting either or . Now, if i.e., then will have a solution . This is true for , therefore, for , is not planar. For , is clearly a planar function. For , computations show that the cardinality of the image set of on is strictly less than . Therefore, is not planar in these cases. For , computations show that is planar for every choice of .
Case 3. Let . In this case, the only DO polynomials we are getting are the monomials of the form where and by [4, Theorem 3.3], these monomials are planar over whenever is odd.
In view of the foregoing discussion, the following theorem gives the list of planar DO polynomials arising from RDPs of arbitrary kind.
Theorem 8.4**.**
Let as defined in the Introduction. Then the following are the only planar DO polynomials arising from
- (i)
* over .* 2. (ii)
* over with odd.* 3. (iii)
* over with .* 4. (iv)
* over with .*
Acknowledgments
The authors would like to express their sincere appreciation for the reviewers’ careful reading, beneficial comments and suggestions, and to the editors for the prompt handling of our paper. The research of Sartaj Ul Hasan is partially supported by Start-up Research Grant SRG/2019/000295 from the Science and Engineering Research Board, Government of India
Appendix A The complete list of DO polynomials
Here, we present the complete list of DO polynomials obtained from polynomial over a finite field of odd characteristic.
- (1)
The case .
- (a)
When
- (i)
, for nonnegative integers , and . 2. (ii)
, for nonnegative integers and . 3. (iii)
, for nonnegative integers and . 4. (iv)
, for nonnegative integers and . 2. (b)
When
- (i)
, for nonnegative integers and . 2. (ii)
, for nonnegative integers and . 3. (iii)
, for nonnegative integers and . 4. (iv)
, for nonnegative integers and . 5. (v)
, for nonnegative integers and . 6. (vi)
, for nonnegative integer . 7. (vii)
, for nonnegative integer . 8. (viii)
, for nonnegative integer . 9. (ix)
, for nonnegative integer . 10. (x)
, for nonnegative integer . 3. (c)
When
- (i)
, for nonnegative integers and . 2. (ii)
, for nonnegative integers and . 3. (iii)
, for nonnegative integers and . 4. (iv)
, for nonnegative integers and . 5. (v)
, for nonnegative integers and . 6. (vi)
, for nonnegative integer . 7. (vii)
for nonnegative integer . 8. (viii)
, for nonnegative integer . 9. (ix)
, for nonnegative integer . 10. (x)
, for nonnegative integer . 2. (2)
The case .
- (a)
When
- (i)
, for non negative integers , and . 2. (ii)
, for non negative integers , and . 2. (b)
When
- (i)
, for nonnegative integers and . 2. (ii)
, for nonnegative integers and . 3. (iii)
, for nonnegative integer . 3. (c)
When
- (i)
, for nonnegative integers and . 2. (ii)
, for nonnegative integer . 3. (iii)
, for nonnegative integer . 4. (d)
When
- (i)
, for nonnegative integers and . 2. (ii)
, for nonnegative integer . 3. (iii)
, for nonnegative integer . 5. (e)
When
- (i)
, for nonnegative integers and . 2. (ii)
, for nonnegative integer . 3. (iii)
, for nonnegative integer . 3. (3)
The case .
In this case, we are getting DO polynomials of the form where .
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] W. Bosma, J. Cannon, C. Playoust, The Magma algebra system I: The user language, J. Symbolic Comput. 24 (1997) 235-265.
- 2[2] C. Carlet, C. Ding, J. Yuan, Linear codes from perfect nonlinear mappings and their secret sharing schemes , IEEE Trans. Inform. Theory, 51 (6) (2005), 2089-2102.
- 3[3] J. S. Chahal, S. R. Ghorpade, Carlitz-Wan conjecture for permutation polynomials and Weil bound for curves over finite fields , Finite Fields Appl., 54 (2018) 366-375.
- 4[4] R.S. Coulter, R.W. Matthews, Planar functions and planes of Lenz-Barlotti class II , Des. Codes Cryptogr., 10 (1997) 167-184.
- 5[5] R. S. Coulter, R. W. Mattews, Dembowski-Ostrom polynomials from Dickson polynomials , Finite Fields Appl., 16 (2010) 369-379.
- 6[6] P. Dembowski, T. G. Ostrom, Planes of order n 𝑛 n with collineation groups of order n 2 superscript 𝑛 2 n^{2} , Math. Z., 103 (1968) 239-258.
- 7[7] L. E. Dickson, The analytic presentation of substitutions on a power of a prime number of letters with a discussion of the linear group , Ann. of Math. 11 (1897), 65–120.
- 8[8] N. Fernando, Reversed Dickson polynomials of the ( k + 1 ) 𝑘 1 (k+1) -th kind over finite fields , J. Number Theory, 172 (2017) 234-255.
