New classes of permutation polynomials with coefficients 1 over finite fields

Abstract

Permutation polynomials with coefficients 1 over finite fields attract researchers' interests due to their simple algebraic form. In this paper, we first construct four classes of fractional permutation polynomials over the cyclic subgroup of F22m . From these permutation polynomials, three new classes of permutation polynomials with coefficients 1 over F22m are constructed, and three more general new classes of permutation polynomials with coefficients 1 over F22m are constructed using a new method we presented recently. Some known permutation polynomials are the special cases of our new permutation polynomials. Furthermore, we prove that, in all new permutation polynomials, there exists a permutation polynomial which is EA-inequivalent to known permutation polynomials for all even positive integer m . This proof shows that EA-inequivalent permutation polynomials over Fq can be constructed from EA-equivalent permutation polynomials over the cyclic subgroup of Fq . From this proof, it is obvious that, in all new permutation polynomials, there exists a permutation polynomial of which algebraic degree is the maximum algebraic degree of permutation polynomials over F22m .

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…