Search engine for discovering works of Art, research articles, and books related to Art and Culture
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
On Permutation BE-algebra
On Permutation BE-algebra
We present permutation BE-algebras as a new class of BE-algebras and examine their basic features in this work. The goal of this paper is to look into and discuss some new notions ...
Permutation and local permutation polynomials of maximum degree
Permutation and local permutation polynomials of maximum degree
Abstract
Let
$$\mathbb {F}_q$$
F
q
...
On Convolved Fibonacci Polynomials
On Convolved Fibonacci Polynomials
This work delves deeply into convolved Fibonacci polynomials (CFPs) that are considered generalizations of the standard Fibonacci polynomials. We present new formulas for these pol...
Novel Formulas of Schröder Polynomials and Their Related Numbers
Novel Formulas of Schröder Polynomials and Their Related Numbers
This paper explores the Schröder polynomials, a class of polynomials that produce the famous Schröder numbers when x=1. The three-term recurrence relation and the inversion formula...
Reentrant permutation flow shop problems: definitions and heuristics
Reentrant permutation flow shop problems: definitions and heuristics
Abstract
In a flow shop, jobs are serially processed on a set of machines and the machine order is the same for all the jobs. In a permutation flow shop, there is...
Some Orthogonal Combinations of Legendre Polynomials
Some Orthogonal Combinations of Legendre Polynomials
The principle objective of this article is to introduce and investigate a type of orthogonal polynomials that are written as combinations of Legendre polynomials. This kind of poly...
New Formulas and Connections Involving Euler Polynomials
New Formulas and Connections Involving Euler Polynomials
The major goal of the current article is to create new formulas and connections between several well-known polynomials and the Euler polynomials. These formulas are developed using...
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...