Necessities and sufficiencies of a class of permutation polynomials over finite fields

07/28/2019
by   Xiaogang Liu, et al.
0

For the finite field F_2^3m, permutation polynomials of the form (x^2^m+x+δ)^s+cx are studied. Necessary and sufficient conditions are given for the polynomials to be permutation polynomials. For this, the structures and properties of the field elements are analyzed.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/08/2019

Further results on some classes of permutation polynomials over finite fields

Let F_q denote the finite fields with q elements. The permutation behavi...
research
08/02/2023

Permutation and local permutation polynomial of maximum degree

Let F_q be the finite field with q elements and F_q[x_1,…, x_n] the ring...
research
11/08/2022

Bounds on the differential uniformity of the Wan-Lidl polynomials

We study the differential uniformity of the Wan-Lidl polynomials over fi...
research
09/18/2019

On a conjecture about a class of permutation quadrinomials

Very recently, Tu et al. presented a sufficient condition about (a_1,a_2...
research
06/14/2017

On the Complexity of Exact Counting of Dynamically Irreducible Polynomials

We give an efficient algorithm to enumerate all sets of r> 1 quadratic p...
research
01/15/2020

The Bhargava greedoid as a Gaussian elimination greedoid

Inspired by Manjul Bhargava's theory of generalized factorials, Fedor Pe...
research
12/21/2017

A Recursive Construction of Permutation Polynomials over F_q^2 with Odd Characteristic from Rédei Functions

In this paper, we construct two classes of permutation polynomials over ...

Please sign up or login with your details

Forgot password? Click here to reset