Abstract
In this paper, we propose a construction of functions with low differential uniformity based on known perfect nonlinear functions over finite fields of odd characteristic. For an odd prime power q, it is proved that the proposed functions over the finite field \(\mathbb{F}_q\) are permutations if and only if q ≡ 3 (mod 4).
Similar content being viewed by others
References
Beth T, Ding C. On almost perfect nonlinear permutations. In: Advances in Cryptology Eurocrypt’93. Lecture Notes on Computer Science, vol. 765. Berlin: Springer-Verlag, 1994, 65–76
Bierbrauer J. New semifields, PN and APN functions. Des Codes Cryptogr, 2010, 54: 189–200
Biham E, Shamir A. Differential cryptanalysis of DES-like cryptosystems. J Cryptol, 1991, 4: 3–72
Bracken C, Leander G. A highly nonlinear differentially 4 uniform power mapping that permutes fields of even degree. Finite Fields Appl, 2010, 16: 231–242
Browning K, Dillon J, Kibler R, et al. APN polynomials and related codes. J Combin Inform Sys Sci, 2009, 34: 135–159
Browning K, Dillon J, McQuistan M, et al. An APN permutation in dimension six. In: Proceedings of the 9th Conference on Finite Fields and Applications FQ9. Contemp Math, 2010, 518: 33–42
Budaghyan L, Helleseth T. New perfect nonlinear multinomials over \(\mathbb{F}_{p^{2k} }\) for any odd prime p. In: Proceedings of International Conference on Sequences and Their Applications SETA 2008. Lecture Notes on Computer Science, vol. 5203. Berlin: Springer-Verlag, 2008, 403–414
Budaghyan L, Carlet C, Pott A. New classes of almost bent and almost perfect nonlinear functions. IEEE Trans Inform Theory, 2006, 52: 1141–1152
Budaghyan L, Helleseth T. New commutative semifields defined by new PN multinomials. Cryptogr Commun, 2011, 3: 1–16
Carlet C. Vectorial Boolean functions for cryptography. In: Crama Y, Hammer P, eds. Boolean Models and Methods in Mathematics, Computer Science, and Engineering. Cambridge: Cambridge University Press, 2010: 398–472
Carlet C, Charpin P, Zinoviev V. Codes, bent functions and permutations suitable for DES-like cryptosystems. Des Codes Cryptogr, 1998, 15: 125–156
Charpin P, Kyureghyan G. When does G(x) + γTr(H(x)) permute \(\mathbb{F}_{p^n }\)? Finite Fields Appl, 2009, 15: 615–632
Coulter R, Matthews R. Planar functions and planes of Lenz-Barlotti class II. Des Codes Cryptogr, 1997, 10: 167–184
Daemen J, Rijmen V. The design of rijndael. In: AES-The Advanced Encryption Standard. Berlin: Springer-Verlag, 2002, 221–227
Dembowshi P, Ostrom T. Planes of order n with collineation groups of order n2. Math Z, 1968, 103: 239–258
Ding C, Yuan J. A new family of skew Paley-Hadamard difference sets. J Combin Theory Ser A, 2006, 113: 1526–1535
Felke P. Computing the uniformity of power mappings: a systematic approach with the multi-variate method over finite fields of odd characteristic. Ph.D. Dissertation. University of Bochum, Bochum, Germany, 2005
Helleseth T, Kholosha A. Monomial and quadratic bent functions over the finite fields of odd characteristic. IEEE Trans Inform Theory, 2006, 52: 2018–2032
Helleseth T, Rong C, Sandberg D. New families of almost perfect nonlinear power mappings. IEEE Trans Inform Theory, 1999, 45: 475–485
Helleseth T, Sandberg D. Some power mappings with low differential uniformity. Appl Algebra Engrg Comm Comput, 1997, 8: 363–370
Hollmann H, Xiang Q. A class of permutation polynomials of \(\mathbb{F}_{2^m }\) related to Dickson polynomials. Finite Fields Appl, 2005, 11: 111–122
Hou X D. Two classes of permutation polynomials over finite fields. J Combin Theory Ser A, 2011, 118: 448–454
Kyureghyan G, Pott A. Some theorems on planar mappings. In: Proceedings of WAIFI 2008. Lecture Notes on Computer Science, vol. 5130. Berlin: Springer-Verlag, 2008, 115–122
Nyberg K. Differentially uniform mappings for cryptography. In: Advances in Cryptology Eurocrypt’93. Lecture Notes on Computer Science, vol. 765. Berlin: Springer-Verlag, 1994, 55–64
Weng G B, Dong C P. A note on permutation polynomials over ℤn. IEEE Trans Inform Theory, 2008, 54: 4388–4390
Weng G B, Zeng X Y. Further results on planar DO functions and commutative semifields. Des Codes Cryptogr, 2012, 63: 413–423
Yuan J, Ding C. Four classes of permutation polynomials of \(\mathbb{F}_{2^m }\). Finite Fields Appl, 2007, 13: 869–876
Yuan J, Ding C, Wang H, et al. Permutation polynomials of the form (xp − x + δ)s + L(x). Finite Fields Appl, 2008, 14: 482–493
Zha Z B, Hu L. Two classes of permutation polynomials over finite fields. Finite Fields Appl, 2012, 18: 781–790
Zha Z B, Kyureghyan G, Wang X. Perfect nonlinear binomials and their semifields. Finite Fields Appl, 2009, 15: 125–133
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Jia, W., Zeng, X., Li, C. et al. Permutation polynomials with low differential uniformity over finite fields of odd characteristic. Sci. China Math. 56, 1429–1440 (2013). https://doi.org/10.1007/s11425-013-4599-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11425-013-4599-8