nach oben

Designs, Codes and Cryptography

Erschienen in:

18.06.2016

Some new results on permutation polynomials over finite fields

verfasst von: Jingxue Ma, Tao Zhang, Tao Feng, Gennian Ge

Erschienen in: Designs, Codes and Cryptography | Ausgabe 2/2017

Einloggen, um Zugang zu erhalten

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

Permutation polynomials over finite fields constitute an active research area and have applications in many areas of science and engineering. In this paper, four classes of monomial complete permutation polynomials and one class of trinomial complete permutation polynomials are presented, one of which confirms a conjecture proposed by Wu et al. (Sci China Math 58:2081–2094, 2015). Furthermore, we give two classes of permutation trinomial, and make some progress on a conjecture about the differential uniformity of power permutation polynomials proposed by Blondeau et al. (Int J Inf Coding Theory 1:149–170, 2010).

Vorheriger Artikel Generic attacks on the Lai–Massey scheme

Nächster Artikel On the number of irreducible linear transformation shift registers

Berlekamp E.R., Rumsey H., Solomon G.: On the solution of algebraic equations over finite fields. Inform. Control 10, 553–564 (1967).

Blondeau C., Canteaut A., Charpin P.: Differential properties of power functions. Int. J. Inf. Coding Theory 1, 149–170 (2010).

Charpin P., Kyureghyan G.M.: Cubic monomial bent functions: a subclass of \({\cal M}\). SIAM J. Discret Math. 22, 650–665 (2008).

Ding C., Yuan J.: A family of skew Hadamard difference sets. J. Comb. Theory Ser. A 113, 1526–1535 (2006).

Ding C., Qu L., Wang Q., Yuan J., Yuan P.: Permutation trinomials over finite fields with even characteristic. SIAM J. Discret Math. 29, 79–92 (2015).

Ding C., Xiang Q., Yuan J., Yuan P.: Explicit classes of permutation polynomials of \(\mathbb{F}_{3^{3m}}\). Sci. China Ser. A 52, 639–647 (2009).

Akbary A., Ghioca D., Wang Q.: On constructing permutations of finite fields. Finite Fields Appl. 17, 51–67 (2011).

Dobbertin H.: Almost perfect nonlinear power functions on \({\rm GF}(2^n)\): the Welch case. IEEE Trans. Inf. Theory 45, 1271–1275 (1999).

Dobbertin H.: Kasami power functions, permutation polynomials and cyclic difference sets. In: Difference Sets, Sequences and Their Correlation Properties (Bad Windsheim, 1998). Nato Advanced Science Institutes Series C Mathematical and Physical Sciences, vol. 542, pp. 133–158. Kluwer, Dordrecht (1999).

10.

Fernando N., Hou X.: A piecewise construction of permutation polynomials over finite fields. Finite Fields Appl. 18, 1184–1194 (2012).

11.

Helleseth T.: Some results about the cross-correlation function between two maximal linear sequences. Discret Math. 16, 209–232 (1976).

12.

Hollmann H.D.L., Xiang Q.: A class of permutation polynomials of \({\bf F}_{2^m}\) related to Dickson polynomials. Finite Fields Appl. 11, 111–122 (2005).

13.

Hou X.: Two classes of permutation polynomials over finite fields. J. Comb. Theory Ser. A 118, 448–454 (2011).

14.

Hou X.: A new approach to permutation polynomials over finite fields. Finite Fields Appl. 18, 492–521 (2012).

15.

Hou X.: Permutation polynomials over finite fields—a survey of recent advances. Finite Fields Appl. 32, 82–119 (2015).

16.

Laigle-Chapuy Y.: Permutation polynomials and applications to coding theory. Finite Fields Appl. 13, 58–70 (2007).

17.

Li N., Helleseth T., Tang X.: Further results on a class of permutation polynomials over finite fields. Finite Fields Appl. 22, 16–23 (2013).

18.

Lidl R., Niederreiter H.: Finite Fields. Encyclopedia of Mathematics and Its Applications, vol. 20. Addison-Wesley Publishing Company Advanced Book Program, Reading, MA (1983).

19.

Niederreiter H., Robinson K.H.: Complete mappings of finite fields. J. Aust. Math. Soc. Ser. A 33, 197–212 (1982).

20.

Qu L., Tan Y., Tan C.H., Li C.: Constructing differentially 4-uniform permutations over \({\mathbb{F}}_{2^{2k}}\) via the switching method. IEEE Trans. Inf. Theory 59, 4675–4686 (2013).

21.

Sun J., Takeshita O.Y.: Interleavers for turbo codes using permutation polynomials over integer rings. IEEE Trans. Inf. Theory 51, 101–119 (2005).

22.

Tu Z., Zeng X., Hu L.: Several classes of complete permutation polynomials. Finite Fields Appl. 25, 182–193 (2014).

23.

Tu Z., Zeng X., Hu L., Li C.: A class of binomial permutation polynomials. arXiv:1310.0337 (2013).

24.

Wu G., Li N., Helleseth T., Zhang Y.: Some classes of monomial complete permutation polynomials over finite fields of characteristic two. Finite Fields Appl. 28, 148–165 (2014).

25.

Wu G., Li N., Helleseth T., Zhang Y.: Some classes of complete permutation polynomials over \({{\mathbb{F}}_q}\). Sci. China Math. 58, 2081–2094 (2015).

26.

Yuan J., Ding C.: Four classes of permutation polynomials of \({\mathbb{F}}_{2^m}\). Finite Fields Appl. 13, 869–876 (2007).

27.

Yuan J., Ding C., Wang H., Pieprzyk J.: Permutation polynomials of the form \((x^p-x+\delta )^s+L(x)\). Finite Fields Appl. 14, 482–493 (2008).

28.

Zha Z., Hu L.: Two classes of permutation polynomials over finite fields. Finite Fields Appl. 18, 781–790 (2012).

29.

Zieve M.E.: Permutation polynomials induced from permutations of subfields, and some complete sets of mutually orthogonal latin squares. arXiv:1312.1325 (2013).

Titel: Some new results on permutation polynomials over finite fields
verfasst von: Jingxue Ma
Tao Zhang
Tao Feng
Gennian Ge
Publikationsdatum: 18.06.2016
Verlag: Springer US
Erschienen in: Designs, Codes and Cryptography / Ausgabe 2/2017
Print ISSN: 0925-1022
Elektronische ISSN: 1573-7586
DOI: https://doi.org/10.1007/s10623-016-0236-1

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Weitere Artikel der Ausgabe 2/2017

On the number of irreducible linear transformation shift registers

Primitive semifields of order

On the snake-in-the-box codes for rank modulation under Kendall’s -metric

A new counting method to bound the number of active S-boxes in Rijndael and 3D

Truncated differential based known-key attacks on round-reduced SIMON

An iterative algorithm for parametrization of shortest length linear shift registers over finite chain rings