Construction of Permutation Polynomials over Finite Fields with the help of SCR polynomials

Abstract

In this paper we take a deeper look at the self conjugate reciprocal (SCR) polynomials, which towards the end of the paper aid the construction of new classes of permutation polynomials of simpler forms over Fq2. The paper focuses on the conditions required for a certain class of degree 2 and degree 3 SCR polynomials to have no roots in μq+1 (the set of (q+1)-th roots of unity), which helps in the determination of polynomials that permute Fq2. In the due course we also look upon some higher degree SCR polynomials which can be reduced down to a degree 2 SCR polynomial over both odd and even ordered fields. We further look upon the SCR polynomials of type axq+1+bxq+bx+aq taking both the cases under consideration viz. a∈ Fq and a∈Fq2q both.

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…