Research Article | Open Access

Volume 2013 |Article ID 917507 | https://doi.org/10.1155/2013/917507

Menglong Su, Zhengbang Zha, Zhonghai Xu, "Another Class of Perfect Nonlinear Polynomial Functions", Mathematical Problems in Engineering, vol. 2013, Article ID 917507, 5 pages, 2013. https://doi.org/10.1155/2013/917507

# Another Class of Perfect Nonlinear Polynomial Functions

Revised10 Nov 2013
Accepted24 Nov 2013
Published03 Dec 2013

#### Abstract

Perfect nonlinear (PN) functions have been an interesting subject of study for a long time and have applications in coding theory, cryptography, combinatorial designs, and so on. In this paper, the planarity of the trinomials over GF() are presented. This class of PN functions are all EA-equivalent to .

#### 1. Introduction

Letbe a prime anda finite field withelements. Letbe a mapping fromto itself. Letdenote the number of solutionsof, where, and let. Nyberg [1] defined a mappingto be differentially-uniform if. For applications in cryptography, one would like to employ functions for whichis as small as possible. The differentially 2-uniform function is called APN function. And we know that APN functions are optimal over. This concept is of interest in cryptography since differential and linear cryptanalysis exploit the uniform property of the functions which are used in many block ciphers, such as DES. The differentially 1-uniform function is called PN function. It is interesting to observe that PN functions have also been studied under the name of planar functions which are functions such thatis a permutation polynomial for all. Planar functions were introduced in [2] to describe projective planes with certain properties. In recent papers [3, 4], PN functions were used to describe new finite commutative semifields of odd order. In [5, 6], it was shown that a PN function yields either a skew Hadamard difference set or a Paley type partial difference set depending on(mod 4). PN function is one of the most important cryptographic functions [7, 8] and has extensive applications in cryptography and communication. For example, PN and APN functions were used to construct optimal constant-composition codes and signal sets [9, 10].

Since PN functions have many applications in coding theory, cryptography, combinatorial designs, and so on, it is interesting to find new PN functions. We call a function “new” only if it is CCZ-inequivalent to the old ones. As we know, there are only three classes of PN monomials. Whether there exists another class of PN monomials is an open problem. In [11], Coulter and Matthews introduced the first family of PN polynomials. Ding and Yuan [5] generalized their results and presented a new skew Hadamard difference set. Helleseth et al. [12] showed a family of PN binomialsoverwhich is equivalent to the monomial. After that, some new methods were used to construct new PN functions (please see [1317] and references therein), but it is still difficult to find more new PN functions. Many constructions of PN functions are used of the link between quadratic PN functions and commutative semifields. Bierbrauer [18] introduced a general projection method to construct commutative semifields and generalized the known PN functions. Pott and Zhou presented a switching construction of PN functions in [19] and introduced a character theoretic approach to prove the planarity of a function in [20]. Recently, they presented new commutative semifields with two parameters and then get new PN functions [21]. In their paper [22], Kyureghyan and Özbudak constructed some new PN functions by the products of two linearized polynomials.

In [12], the binomial composed with inequivalent monomialsandwas shown to be equivalent to the monomialover. What about the planarity of trinomial composed with monomials,and? In this paper, we will answer this question. In Section 2, we recall some definitions and tools used later in the paper. In Section 3, we characterize the planarity of the trinomialsover. These PN trinomials are shown to be equivalent to monomialin Section 4. We then conclude this paper in Section 5 with some future work.

#### 2. Preliminaries

Letbe an odd prime, and letbe a positive integer. Letbe a function ondefined by. Then, we get thatwhen,whenis a square in, andwhenis a nonsquare in.

The-weight of a nonnegative integeris the sum of the digits in its-adic representation; that is, ifwith, then the-ary weight ofis. Recall that any mapping of can be represented by a polynomial overof degree less than. Moreover, different such polynomials define different mappings. This allows us to identify the set of mappings ofwith the set of polynomials overwith degree less than. The algebraic degree of a polynomial overis the maximal-weight of the exponents of its nonzero terms. A polynomial is called quadratic if it has algebraic degree 2. The following polynomials of algebraic degree 2 are called Dembowski-Ostrom (DO) polynomials in [2].

Let. A polynomial of the formis called linearized or-polynomial over. The sum of a linear mapping and a constant inis called an affine mapping.

Two functionsare called extended affine (EA) equivalent, iffor some affine permutationsand affine function. The functionsandare called Carlet-Charpin-Zinoviev (CCZ) equivalent if the graphs ofandare affine equivalent [23]. CCZ-equivalent functions have the same differential uniformity and the same extended Walsh spectrum. It is showed in [24] that the CCZ-equivalence coincides with the EA-equivalence for PN functions. For planar DO polynomials, CCZ-equivalence coincides with linear equivalence [14].

In [3], Coulter and Henderson proved that planar DO polynomials are equivalent to commutative semifields with odd characteristic. Many new PN functions are defined by corresponding commutative semifields with no explicit function expressions, such as Dickson semifields and Cohen-Ganley semifileds [4, 25, 26]. In the following, we just list the known EA-inequivalent PN functions which have explicit function expressions:(a)over(folklore);(b)over, whereandis odd ([2, 11]);(c)over, whereis odd ([5, 11]);(d)over, where,,is odd, ord, and at least one of the following conditions hold:mod 3,mod 3 ([13, 17]);(e)over, whereis odd, ord, andmod 4 ([13]);(f)over, whereis odd and([11]);(g)over, where,,,is a positive integer,is not ath power, and there is nosuch thatand([14, 18]);(h)over, whereis a power of an odd prime,,  andwith([18, 27]);(i)over([28]).

Below, we always letbe an odd prime and, , positive integers withand.

#### 3. A New Family of PN Trinomials over

In this section, we propose a new family of PN trinomials overwhich are composed of inequivalent monomialsand.

Theorem 1. Letwith, and letbe given by. Then,is PN if and only if.

Proof. We need to count the number of solutions ofunder the conditions defined above for anyin. The equationcan be written as Let. Then, (2) turns to As (3) is affine, we just need to consider the case. When, for the functionto be PN, it is necessary and sufficient thathasas its only solution for any nonzero. That is, sayhas no solution over. Therefore,is PN if and only if the equationis not true. It can be written as If, (4) is always true. We assume that. Let. Since, we can get from (4). Then, we getwith. As we know, then we have
Since, then we get. Ifor −1, we can obviously find that (6) is true. If, then we get from (6). It leads toand, which contradicts the first assumption. Therefore,is PN if and only if.

We can get the following corollary from Theorem 1.

Corollary 2. Letbe given by, where. Then,is PN if and only if (mod 4),or (mod 4),.

Proof. From Theorem 1, we get thatis PN if and only if. Since, we just need;is ath power. When,is ath power if and only if −1 is ath power, which is equivalent to (mod 4). When, we get thatis ath power and notth power. In this case,is ath power if and only if (mod 4).

Remark 3. Ifis PN in Corollary 2, we havefor accuracy. Since, then we get. Whether (mod 4),or (mod 4),, we get thatis ath power and not ath power, which implies.

The PN functions defined in Corollary 2 exist. For example, the functionis PN over, whereis even.

#### 4. The Linear Equivalence of the New PN Trinomials

In this section, we will discuss the linear equivalence between our new PN functions and the known PN monomial. First, we give a simple proof to show that the PN functions defined in Corollary 2 are equivalent to.

Theorem 4. The PN functiondefined in Corollary 2 is linear equivalent to.

Proof. Since, we obtainandis ath power. Let, and let,be linear polynomials on. We can get.
Assume that , we obtain, which implies thator. If, we get. Sinceis not ath power in Corollary 2 then we haveand. Thus,is a linear permutation.
If one ofandequals to 0, we can get thatis a linear permutation. If both ofandequal 0, we can get. This is not true for. Otherwise, we assume. Then, we getor. If, we get. We can deduce that. It leads to Then, we get thatis ath power which contradicts the known result. Therefore,is also a linear permutation. This completes the proof.

Inspired by the proof of Theorem 4, we get a generalized result in the following theorem.

Theorem 5. The PN functiondefined in Theorem 1 is linear equivalent to.

Proof. If the PN functionis linear equivalent toover, there must exist linear permutationsandsuch that When, there is no item of the typeon the left side of (9). Then, we can get that the coefficient ofequals to 0. It shows that. Assume that for some, we obtain thatwhen. Then, (9) can be written as When, , we can see that there is no item of typeandon the right side of (10). Then, we haveand. This leads toand. Since, then we obtain thatwhen, . Therefore, (10) can be written as Comparing the coefficients of,, andof (11), we can get the following equations: From (12) and (13), we obtain. We can also obtainfrom (13) and (14). Then, we have We note thatis a permutation if and only ifis not ath power. Comparing (5) and (15), we have. Under the conditions of Theorem 1,is not true. Then, we get thatis not ath power andis a permutation.
From (12)–(14), we get and . If one ofandequals to 0, thenis a monomial permutation. If both ofandequal to 0, we get, which leads to a contradiction. Now, we consider the case that bothandare not equal to 0. In this case,is a permutation if and only ifis not ath power. We assume thatis ath power. Then, we have, which implies From (15), we can getwithdefined in Theorem 1. Substituting the value ofinto (16), we have Since, from (17), we get, which is a contradiction. Therefore, we get thatis not ath power andis a permutation. The proof is completed.

#### 5. Conclusion

In this paper, we present a family of PN trinomials and determine the necessary and sufficient conditions which assure their planarity. All these PN functions are shown to be equivalent to the known PN functionby using the definition of linear equivalence. Our results give an answer for the question presented in the introduction. It seems hard to determine the planarity of the linear combination of terms over, whereandis an odd prime power. However, it may be possible to determine them in some special cases (e.g., see [15]). We will continue this study and try to find more new PN functions in the future work.

#### Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

#### Acknowledgments

We would like to thank the anonymous reviewers for their invaluable suggestions and helpful comments, which greatly improved the paper. We sincerely thank the Editor for the kind help provided. This project was supported by NSFC-Union Science Foundation of Henan (no. U1304103), National Nature Science Foundation of China (no. 11201214), Natural Science Foundation of Henan Province (no. 122300410261), and Foundation of Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education (no. 93K172012K07).

#### References

1. K. Nyberg, “Differentially uniform mappings for cryptography,” in Advances in Cryptology—EUROCRYPT '93, vol. 765 of Lecture Notes in Computer Science, pp. 55–64, Springer, Berlin, Germany, 1994.
2. P. Dembowski and T. G. Ostrom, “Planes of order n with collineation groups of order n2,” Mathematische Zeitschrift, vol. 103, no. 3, pp. 239–258, 1968.
3. R. S. Coulter and M. Henderson, “Commutative presemifields and semifields,” Advances in Mathematics, vol. 217, no. 1, pp. 282–304, 2008.
4. R. S. Coulter, M. Henderson, and P. Kosick, “Planar polynomials for commutative semifields with specified nuclei,” Designs, Codes and Cryptography, vol. 44, no. 1–3, pp. 275–286, 2007.
5. C. Ding and J. Yuan, “A new family of skew Hadamard difference sets,” Journal of Combinatorial Theory A, vol. 113, no. 7, pp. 1526–1535, 2006.
6. G. Weng, W. Qiu, Z. Wang, and Q. Xiang, “Pseudo-Paley graphs and skew Hadamard difference sets from presemifields,” Designs, Codes and Cryptography, vol. 44, no. 1–3, pp. 49–62, 2007.
7. Z. Tu and Y. Deng, “A conjecture about binary strings and its applications on constructing Boolean functions with optimal algebraic immunity,” Designs, Codes and Cryptography, vol. 60, no. 1, pp. 1–14, 2011.
8. W. Zhang and G. Xiao, “Constructions of almost optimal resilient Boolean functions on large even number of variables,” IEEE Transactions on Information Theory, vol. 55, no. 12, pp. 5822–5831, 2009. View at: Publisher Site | Google Scholar | MathSciNet
9. C. Ding and J. Yin, “Signal sets from functions with optimum nonlinearity,” IEEE Transactions on Communications, vol. 53, no. 5, pp. 936–940, 2007. View at: Google Scholar
10. C. Ding and J. Yuan, “A family of optimal constant-composition codes,” IEEE Transactions on Information Theory, vol. 51, no. 10, pp. 3668–3671, 2005.
11. R. S. Coulter and R. W. Matthews, “Planar functions and planes of Lenz-Barlotti class II,” Designs, Codes and Cryptography, vol. 10, no. 2, pp. 167–184, 1997.
12. T. Helleseth, G. Kyureghyan, G. J. Ness, and A. Pott, “On a family of perfect nonlinear binomials,” in Boolean Functions in Cryptology and Information Security, B. Preenel and O. A. Logachev, Eds., vol. 18, pp. 126–138, IOS, Amsterdam, The Netherlands, 2008.
13. J. Bierbrauer, “New semifields, PN and APN functions,” Designs, Codes and Cryptography, vol. 54, no. 3, pp. 189–200, 2010.
14. L. Budaghyan and T. Helleseth, “New commutative semifields defined by new PN multinomials,” Cryptography and Communications, vol. 3, no. 1, pp. 1–16, 2011.
15. G. Kyureghyan and Y. Tan, “On a family of planar mappings,” in Enhancing Cryptographic Primitives with Techniques from Error Correcting Codes, B. Preenel, S. Dodunekov, V. Rijmen, and S. Nikova, Eds., vol. 23, pp. 175–178, IOS, Amsterdam, The Netherlands, 2009. View at: Google Scholar | MathSciNet
16. Z. Zha, G. M. Kyureghyan, and X. Wang, “Perfect nonlinear binomials and their semifields,” Finite Fields and Their Applications, vol. 15, no. 2, pp. 125–133, 2009.
17. Z. Zha and X. Wang, “New families of perfect nonlinear polynomial functions,” Journal of Algebra, vol. 322, no. 11, pp. 3912–3918, 2009.
18. J. Bierbrauer, “Commutative semifields from projection mappings,” Designs, Codes and Cryptography, vol. 61, no. 2, pp. 187–196, 2011.
19. A. Pott and Y. Zhou, “Switching construction of planar functions on finite fields,” in Proceedings of the Third International Workshop (WAIFI '10), vol. 6087 of Lecture Notes in Computer Science, pp. 135–150, Springer, 2010.
20. A. Pott and Y. Zhou, “A character theoretic approach to planar functions,” Cryptography and Communications, vol. 3, no. 4, pp. 293–300, 2011.
21. Y. Zhou and A. Pott, “A new family of semifields with 2 parameters,” Advances in Mathematics, vol. 234, pp. 43–60, 2013.
22. G. Kyureghyan and F. Özbudak, “Planarity of products of two linearized polynomials,” Finite Fields and Their Applications, vol. 18, no. 6, pp. 1076–1088, 2012.
23. C. Carlet, P. Charpin, and V. Zinoviev, “Codes, bent functions and permutations suitable for DES-like cryptosystems,” Designs, Codes and Cryptography, vol. 15, no. 2, pp. 125–156, 1998.
24. G. Kyureghyan and A. Pott, “Some remarks on planar mappings,” in Proceedings of the 2nd International Workshop (WAIFI '08), vol. 5130 of LNCS, pp. 117–122, Springer, 2008.
25. S. D. Cohen and M. J. Ganley, “Commutative semifields, two-dimensional over their middle nuclei,” Journal of Algebra, vol. 75, no. 2, pp. 373–385, 1982.
26. L. E. Dickson, “On commutative linear algebras in which division is always uniquely possible,” Transactions of the American Mathematical Society, vol. 7, no. 4, pp. 514–522, 1906. View at: Publisher Site | Google Scholar | MathSciNet
27. G. Lunardon, G. Marino, O. Polverino, and R. Trombetti, “Symplectic spreads and quadric veroneseans,” in Proceedings of the Cryptology, Designs and Finite Groups (CDFG '09), Deerfield Beach, Fla, USA, 2009. View at: Publisher Site | Google Scholar
28. N. At and S. D. Cohen, “A new tool for assurance of perfect nonlinearity,” in Sequences and Their Applications—SETA 2008, vol. 5203, pp. 415–419, Springer, Berlin, Germany, 2008.

Copyright © 2013 Menglong Su et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.