International audienceDickson polynomials which are permutations are interesting combinatorial objectsand well studied.In this paper, we describe Dickson polynomials of the first kind in $\F_2[x]$ that are involutions over finite fields of characteristic $2$. Such description is obtained using modular arithmetic's tools. We give results related to the cardinality and the number of fixed points (in the context of cryptographic application) of this corpus.We also present infinite classes of Dickson involutions. We study Dickson involutions which have a minimal set of fixed points
AbstractLet Fq denote the finite field of order q where q is a prime power. If a ∈ Fq and d ≥ 1 is a...
AbstractLet Fq denote the finite field of order q where q is a prime power. If a ∈ Fq and d ≥ 1 is a...
AbstractLetTn(x,a) ∈ GF(q)[x] be a Dickson polynomial over the finite field GF(q) of either the firs...
Dickson polynomials which are permutations are interesting combinato-rial objects and well studied. ...
International audienceDickson polynomials which are permutations are interesting combinatorial objec...
The permutation behavior of Dickson polynomials of the first kind has been extensively studied, whil...
International audienceAn involution is a permutation such that its inverse is itself (i.e., cycle le...
International audienceAn involution is a permutation such that its inverse is itself (i.e., cycle le...
In this paper we introduce the notion of Dickson polynomials of the (k+1)-th kind over finite fields...
AbstractIn this paper we introduce the notion of Dickson polynomials of the (k+1)-th kind over finit...
We construct a class of permutation polynomials of F2m that are closely related to Dickson polynomia...
Involutions over finite fields are permutations whose compositional inverses are themselves. Involut...
2000 Mathematics Subject Classification: 11T06, 13P10.A theorem of S.D. Cohen gives a characterizati...
AbstractReversed Dickson polynomials over finite fields are obtained from Dickson polynomials Dn(x,a...
AbstractWe derive the factorizations of the Dickson polynomialsDn(X,a) andEn(X,a), and of the bivari...
AbstractLet Fq denote the finite field of order q where q is a prime power. If a ∈ Fq and d ≥ 1 is a...
AbstractLet Fq denote the finite field of order q where q is a prime power. If a ∈ Fq and d ≥ 1 is a...
AbstractLetTn(x,a) ∈ GF(q)[x] be a Dickson polynomial over the finite field GF(q) of either the firs...
Dickson polynomials which are permutations are interesting combinato-rial objects and well studied. ...
International audienceDickson polynomials which are permutations are interesting combinatorial objec...
The permutation behavior of Dickson polynomials of the first kind has been extensively studied, whil...
International audienceAn involution is a permutation such that its inverse is itself (i.e., cycle le...
International audienceAn involution is a permutation such that its inverse is itself (i.e., cycle le...
In this paper we introduce the notion of Dickson polynomials of the (k+1)-th kind over finite fields...
AbstractIn this paper we introduce the notion of Dickson polynomials of the (k+1)-th kind over finit...
We construct a class of permutation polynomials of F2m that are closely related to Dickson polynomia...
Involutions over finite fields are permutations whose compositional inverses are themselves. Involut...
2000 Mathematics Subject Classification: 11T06, 13P10.A theorem of S.D. Cohen gives a characterizati...
AbstractReversed Dickson polynomials over finite fields are obtained from Dickson polynomials Dn(x,a...
AbstractWe derive the factorizations of the Dickson polynomialsDn(X,a) andEn(X,a), and of the bivari...
AbstractLet Fq denote the finite field of order q where q is a prime power. If a ∈ Fq and d ≥ 1 is a...
AbstractLet Fq denote the finite field of order q where q is a prime power. If a ∈ Fq and d ≥ 1 is a...
AbstractLetTn(x,a) ∈ GF(q)[x] be a Dickson polynomial over the finite field GF(q) of either the firs...