Constructions of Involutions Over Finite Fields
From MaRDI portal
(Redirected from Publication:5211546)
Abstract: 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 cryptography and coding theory. As far as we know, there are not many involutions, and there isn't a general way to construct involutions over finite fields. This paper gives a necessary and sufficient condition for the polynomials of the form to be involutions over the finite field~, where and . By using this criterion we propose a general method to construct involutions of the form over from given involutions over the corresponding subgroup of . Then, many classes of explicit involutions of the form over are obtained.
Cited in
(25)- Characterizations and constructions of triple-cycle permutations of the form x^rh(x^s)
- On the constructions of n-cycle permutations
- 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}\)
- 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
- Switching Construction of Planar Functions on Finite Fields
- scientific article; zbMATH DE number 6124436 (Why is no real title available?)
- Linear permutations and their compositional inverses over 𝔽qn
- An application of the method of additive chains to inversion in finite fields
- Further investigations on permutation based constructions of bent functions
- Compositional inverses of AGW-PPs -- dedicated to Professor Cunsheng Ding for his 60th birthday
- Permutation polynomials and their compositional inverses over finite fields by a local method
- Further results on \(n\)-cycle permutations
- The existence for a class of composite involution polynomials over finite fields
- The compositional inverses of the permutation polynomials from trace functions over finite fields
- 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
- Further results on a family of bent functions from permutations
- On vector invariants over finite fields
- Finite field constructions of combinatorial arrays
This page was built for publication: 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 Q5211546)