New constructions of permutation polynomials of the form x plus γ Tr q 2 q (h(x)) over finite fields with even characteristic

Permutation polynomials over finite fields are widely used in cryptography, coding theory, and combinatorial design. Particularly, permutation polynomials of the form x + 7 Tr q n q (h(x)) have been studied by many researchers and applied to lift minimal blocking sets. In this paper, we further investigate permutation polynomials of the form x + 7 Tr q 2 q (h(x)) over finite fields with even characteristic. On the one hand, guided by the idea of choosing functions h with a low q-degree, we completely determine the sufficient and necessary conditions of 7 for six classes of polynomials of the form x + 7 Tr q 2 q (h(x)) with h ( x ) = c1x + c 2 x 2 + c 3 x 3 + c 4 x q +2 and c i is an element of F 2 (i = 1, ... , 4) to be permutations. These results determine the sizes of directions of these six functions, which is generally difficult. On the other hand, we slightly generalize the above idea and construct other six classes of permutation polynomials of the form x + 7 Tr q q 2 ( h ( x )) with h(x) = c 1 x + c 2 x 2 + c 3 x 3 + c 4 x q +2 + x 2q - 1 and c i is an element of F 2 (i = 1, ... , 4). We believe that more results about permutation polynomials of the form x +gamma Trq2 q (h(x)) can be obtained by exploiting this idea. (c) 2024 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.