Monomial functions with linear structure and permutation polynomials

We characterize the monomial functions Tr(δxd) from a finite field into its prime subfield having linear structure. Using this result and the methods introduced in [6], we construct permutation polynomials of finite fields with few non-zero terms.

[1]  Jürgen Bierbrauer,et al.  Crooked binomials , 2008, Des. Codes Cryptogr..

[2]  Claude Carlet.  On Almost Perfect Nonlinear Functions , 2007, 2007 3rd International Workshop on Signal Design and Its Applications in Communications.

[3]  Xuejia Lai,et al.  Additive and Linear Structures of Cryptographic Functions , 1994, FSE.

[4]  R. McEliece.  Finite Fields for Computer Scientists and Engineers , 1986 .

[5]  Pascale Charpin,et al.  On a Class of Permutation Polynomials over F2m , 2008, SETA.

[6]  K. Conrad,et al.  Finite Fields , 2018, Series and Products in the Development of Mathematics.

[7]  Gohar M. M. Kyureghyan.  Constructing permutations of finite fields via linear translators , 2009, J. Comb. Theory, Ser. A.