New constructions of involutions over finite fields
Let \(\mathbb F_q\) be the finite field with \(q\) elements. A polynomial \(f(x)\in\mathbb F_q[x]\) is called an {\em involution} of \(\mathbb F_q\) if \(f(f(a))=a\) for all \(a\in \mathbb F_q\). Involutions of finite fields provide easy decryption algorithms for block ciphers. The paper under review gives several constructions of involutions of \(\mathbb F_{q^2}\) of the form \(x^rh(x^{q-1})\), where \(r=q^2-2\) or \(-q\) and \(h(x)=\gamma(1+\phi(x)+\phi(x)^q)\), where \(\gamma\in\mathbb F_{q^2}^*\) and \(\phi(x)\in\mathbb F_{q^2}[x]\), or \(h(x)=\gamma(x^{a_1}+\beta x^{a_2}+\beta^q x^{a_3})\), where \(\gamma\in\mathbb F_q^*\), \(\beta\in\mathbb F_{q^2}^*\) and \(a_1,a_2,a_3\) are integers satisfying certain conditions. The paper goes on to study permutation polynomials of the form \(f(x)=g(x^{q^i}-x+\delta)+cx\) of \(\mathbb F_{q^m}\), where \(g(x)\in\mathbb F_{q^m}[x]\). The compositional inverse of such a PP is determined. Moreover, it is shown that \(f(x)=g(x^{q^i}-x+\delta)+x\) is an involution of \(\mathbb F_{q^m}\) for all \(\delta\in\mathbb F_{q^m}\) if and only if \(h(x)=g(x)^{q^i}-g(x)+x\) is an involution of \(\mathbb F_{q^m}\) and \(g(h(x^{q^i}-x+\delta))+g(x^{q^i}-x+\delta)=0\) for all \(\delta\) and \(x\) in \(\mathbb F_{q^m}\). The paper also includes a section in which the number of fixed points of the involutions constructed in the paper is computed.
- Constructions, counts and classifications of cyclotomic involutions over finite fields
- Explicit formulas for monomial involutions over finite fields
- On the construction of differentially 4-uniform involutions
- On inverses of permutation polynomials of the form \(x(x^s-a)^{(q^m-1)/s}\) over \(\mathbb{F}_{q^n}\)
- Dickson polynomials that are involutions
- A family of difference sets in non-cyclic groups
- A family of skew Hadamard difference sets
- A note on inverses of cyclotomic mapping permutation polynomials over finite fields
- A survey on the applications of Niho exponents
- Almost perfect nonlinear power functions on \(\mathrm{GF}(2^n)\): the Niho case.
- Almost perfect nonlinear power functions on GF(2/sup n/): the Welch case
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Compositional inverses and complete mappings over finite fields
- Compositional inverses of permutation polynomials of the form x^rh(x^s) over finite fields
- Cyclic codes from some monomials and trinomials
- Cyclotomic Mapping Permutation Polynomials over Finite Fields
- Determination of a type of permutation trinomials over finite fields. II
- Dickson polynomials that are involutions
- Further results on complete permutation monomials over finite fields
- Further results on permutation trinomials over finite fields with even characteristic
- scientific article; zbMATH DE number 1682693 (Why is no real title available?)
- scientific article; zbMATH DE number 3174791 (Why is no real title available?)
- scientific article; zbMATH DE number 3748927 (Why is no real title available?)
- scientific article; zbMATH DE number 1159777 (Why is no real title available?)
- scientific article; zbMATH DE number 6900650 (Why is no real title available?)
- scientific article; zbMATH DE number 967590 (Why is no real title available?)
- Involutions Over the Galois Field
- New classes of permutation binomials and permutation trinomials over finite fields
- New constructions of permutation polynomials of the form \(x^rh\left( x^{q-1}\right) \) over \({\mathbb F}_{q^2}\)
- On constructing permutations of finite fields
- On some permutation polynomials over $\mathbb {F}_q$ of the form $x^r h(x^{(q-1)/d})$
- On the Behaviors of Affine Equivalent Sboxes Regarding Differential and Linear Attacks
- On the inverses of some classes of permutations of finite fields
- Permutation polynomials and group permutation polynomials
- Permutation polynomials and translation planes of even order
- Permutation polynomials in RSA-cryptosystems
- Permutation polynomials of the form \(cx+\mathrm{Tr}_{q^l/ q}(x^a)\) and permutation trinomials over finite fields with even characteristic
- Permutation polynomials over finite fields -- a survey of recent advances
- Permutation polynomials over finite fields from a powerful lemma
- Permutation trinomials over finite fields with even characteristic
- Permutations via linear translators
- PRINCE -- a low-latency block cipher for pervasive computing applications. Extended abstract
- Several classes of permutation trinomials from Niho exponents
- Some new classes of permutation trinomials over finite fields with even characteristic
- Some new results on permutation polynomials over finite fields
- Symplectic spreads and permutation polynomials
- The compositional inverse of a class of bilinear permutation polynomials over finite fields of characteristic 2
- The compositional inverse of a class of linearized permutation polynomials over \(\mathbb{F}_{2^n}\), \(n\) odd
- The compositional inverse of a class of permutation polynomials over a finite field
- Two types of permutation polynomials with special forms
- Nilpotent linearized polynomials over finite fields and applications
- On the constructions of n-cycle permutations
- Regular complete permutation polynomials over \(\mathbb{F}_{2^n} \)
- Coset-wise affine functions and cycle types of complete mappings
- On inverses of some permutation polynomials over finite fields of characteristic three
- Rédei permutations with cycles of the same length
- Two-to-one mappings and involutions without fixed points over \(\mathbb{F}_{2^n}\)
- Explicit formulas for monomial involutions over finite fields
- A new construction for involutions over finite fields
- On inverses of permutation polynomials of the form \(x(x^s-a)^{(q^m-1)/s}\) over \(\mathbb{F}_{q^n}\)
- More constructions of n-cycle permutations
- Linear permutations and their compositional inverses over 𝔽qn
- Constructions, counts and classifications of cyclotomic involutions over finite fields
- Compositional inverses of AGW-PPs -- dedicated to Professor Cunsheng Ding for his 60th birthday
- Further results on \(n\)-cycle permutations
- The existence for a class of composite involution polynomials over finite fields
- Constructing permutation polynomials from permutation polynomials of subfields
- Nilpotent linearized polynomials over finite fields, revisited
- The cycle structure of a class of permutation binomials
- On differential spectra of involutions with low differential uniformity over finite fields with even characteristic
- Involutions of finite abelian groups with explicit constructions on finite fields
- A survey of compositional inverses of permutation polynomials over finite fields
- Implicit functions over finite fields and their applications to good cryptographic functions and linear codes
This page was built for publication: New constructions of involutions over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2179512)
