Constructions and Necessities of Some Permutation Polynomials over Finite Fields

Let Fq denote the finite field with q elements. Permutation polynomials over finite fields have important applications in many areas of science and engineering such as coding theory, cryptography, and combinatorial design. The study of permutation polynomials has a long history, and many results are...

Full description

Saved in:
Bibliographic Details
Published in:Mathematical problems in engineering 2021-12, Vol.2021, p.1-13
Main Author: Liu, Xiaogang
Format: Article
Language:English
Subjects:
Combinatorial analysis
Cryptography
Engineering
Fields (mathematics)
Permutations
Polynomials
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Let Fq denote the finite field with q elements. Permutation polynomials over finite fields have important applications in many areas of science and engineering such as coding theory, cryptography, and combinatorial design. The study of permutation polynomials has a long history, and many results are obtained in recent years. In this paper, we obtain some further results about the permutation properties of permutation polynomials. Some new classes of permutation polynomials are constructed, and the necessities of some permutation polynomials are studied.
ISSN:1024-123X
1563-5147
DOI:10.1155/2021/9409130