Javascript must be enabled to continue!
Constructions and Necessities of Some Permutation Polynomials over Finite Fields
View through CrossRef
Let
F
q
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.
Title: Constructions and Necessities of Some Permutation Polynomials over Finite Fields
Description:
Let
F
q
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.
Related Results
Image encryption based on permutation polynomials over finite fields
Image encryption based on permutation polynomials over finite fields
In this paper, we propose an image encryption algorithm based on a permutation polynomial over finite fields proposed by the authors. The proposed image encryption process consists...
On the Study of Families of Linearized Polynomials over Finite Fields
On the Study of Families of Linearized Polynomials over Finite Fields
Linearized polynomials are gaining attention from many researchers because of their applications in the field of coding theory, cryptography and finite geometry. The linearized pol...
Truncated-Exponential-Based Appell-Type Changhee Polynomials
Truncated-Exponential-Based Appell-Type Changhee Polynomials
The truncated exponential polynomials em(x) (1), their extensions, and certain newly-introduced polynomials which combine the truncated exponential polynomials with other known pol...
A Novel Image Encryption Algorithm Based on Double Permutation and Random Diffusion
A Novel Image Encryption Algorithm Based on Double Permutation and Random Diffusion
Abstract
To improve the image transmission security, an image encryption algorithm based on double permutation with random diffusion is proposed in this paper. This algorit...
Further results on permutation polynomials and complete permutation polynomials over finite fields
Further results on permutation polynomials and complete permutation polynomials over finite fields
<abstract><p>In this paper, by employing the AGW criterion and determining the number of solutions to some equations over finite fields, we further investigate nine cla...
On Semi-Classical Orthogonal Polynomials Associated with a Modified Sextic Freud-Type Weight
On Semi-Classical Orthogonal Polynomials Associated with a Modified Sextic Freud-Type Weight
Polynomials that are orthogonal with respect to a perturbation of the Freud weight function by some parameter, known to be modified Freudian orthogonal polynomials, are considered....
An efficient permutation approach for SbPN-based symmetric block ciphers
An efficient permutation approach for SbPN-based symmetric block ciphers
AbstractIt is challenging to devise lightweight cryptographic primitives efficient in both hardware and software that can provide an optimum level of security to diverse Internet o...
Generating Functions for New Families of Combinatorial Numbers and Polynomials: Approach to Poisson–Charlier Polynomials and Probability Distribution Function
Generating Functions for New Families of Combinatorial Numbers and Polynomials: Approach to Poisson–Charlier Polynomials and Probability Distribution Function
The aim of this paper is to construct generating functions for new families of combinatorial numbers and polynomials. By using these generating functions with their functional and ...

