An involution is a permutation, such that its inverse is itself (ie, cycle length≤ 2). Due to this
property, involutions have been used in many applications, including cryptography and …

In this paper, we survey on the recent results and methods in the study of compositional
inverses of permutation polynomials over finite fields. In particular, we describe a framework …

Permutation polynomials (PPs) and their inverses have applications in cryptography, coding
theory and combinatorial design theory. In this paper, we make a brief summary of the …

An involution over finite fields is a permutation polynomial whose inverse is itself. Owing to
this property, involutions over finite fields have been widely used in applications, such as …

Involutions over finite fields are permutations whose compositional inverses are themselves.
Involutions especially over F q F_q with q is even have been used in many applications …

Let\mathbb F_ q F q be the finite field with q elements and n ≥ 2 n≥ 2 be a positive integer.
We study the functional graph associated to linear maps over finite fields. In particular, we …

We completely describe the functional graph associated to iterations of Chebyshev
polynomials over finite fields. Then, we use our structural results to obtain estimates for the …

In this paper, two-to-one mappings and involutions without any fixed point on finite fields of
even characteristic are investigated. First, we characterize a closed relationship between …

A finite commutative ring involution is the multiplicative inverse of the element attribute R is
the element itself. This classical characteristic of a finite commutative ring makes …

In this paper, we give necessary and sufficient conditions on n for the unsigned and signed
generalized Lucas polynomials fn (x) and gn (x) being permutations over the prime field …