Compositional inverses and complete mappings over finite fields (Q516831): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2016.09.009 / rank
Normal rank
 
Property / cites work
 
Property / cites work: On permutation polynomials of prescribed shape / rank
 
Normal rank
Property / cites work
 
Property / cites work: On constructing permutations of finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: On polynomials of the form \(x^{r}f(x^{(q - 1)/l})\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing permutation polynomials from piecewise permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: When does \(G(x)+\gamma \, \text{Tr}(H(x))\) permute \(\mathbb F_{p^n}\)? / rank
 
Normal rank
Property / cites work
 
Property / cites work: The compositional inverse of a class of permutation polynomials over a finite field / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on constructing permutation polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic Codes from Some Monomials and Trinomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A family of skew Hadamard difference sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthomorphism graphs of groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: A piecewise construction of permutation polynomials over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two classes of permutation polynomials over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to permutation polynomials over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing permutations of finite fields via linear translators / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on a Class of Quadratic Permutations over ${\mathbb F}_{{2^n}}$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation polynomials and applications to coding theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Specific permutation polynomials over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the coefficients of inverse polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on complete polynomials over finite fields and their applications in cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect nonlinear S-boxes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for obtaining digital signatures and public-key cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Groupoïdes Automorphes Par Le Groupe Cyclique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic permutations, complete mappings and mutually orthogonal latin squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Investigations on Bent and Negabent Functions via the Nega-Hadamard Transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Several classes of complete permutation polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the inverses of some classes of permutations of finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: On inverse permutation polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3001402 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclotomy and permutation polynomials of large indices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On constructing complete permutation polynomials over finite fields of even characteristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearized polynomials over finite fields revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: The compositional inverse of a class of bilinear permutation polynomials over finite fields of characteristic 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation polynomials over finite fields from a powerful lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further results on permutation polynomials over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two classes of permutation polynomials over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing permutations and complete permutations over finite fields via subfield-valued polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of Permutation Polynomials Based on Cyclotomy and an Additive Analogue / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2016.09.009 / rank
 
Normal rank

Latest revision as of 20:13, 9 December 2024

scientific article
Language Label Description Also known as
English
Compositional inverses and complete mappings over finite fields
scientific article

    Statements

    Compositional inverses and complete mappings over finite fields (English)
    0 references
    0 references
    0 references
    15 March 2017
    0 references
    Let \(\mathbb {F}_{q}\) be a finite field with \(q=p^m\) elements and \(f\in \mathbb {F}_{q}[x]\) a univariate polynomial. If \(f\) induces a permutation of \(\mathbb {F}_{q}\) under evaluation then there exists a unique \(f^{-1}\in \mathbb {F}_{q}[x]\) of degree less than \(q\) satisfying \(f(f^{-1}(x)) \equiv f^{-1}(f(x)) \equiv x \pmod{x^q-x}\). The paper under review studies this compositional inverse in case \(f\) is a linearized binomial permuting the kernel of the trace map \(T_{q^n|q^s}: \mathbb {F}_{q^n} \longrightarrow \mathbb {F}_{q^s}\), where \(s\) is a positive divisor of \(n\). In Theorem 2.4 it is shown that for any positive integer \(r\) such that \(d:=\gcd (n,r) =\gcd (r,s)\) and any \(c\in \mathbb {F}_{q^s}\) whose norm \(N^{q^s|q^d}(c)\) equals 1, the binomial \(L_{c,r}(x) :=x^{q^r}-cx\in \mathbb {F}_{q^n} [x]\) induces a permutation of \(\ker (T_{q^n|q^s})\) if and only if \(n/s\) is not divisible by the characteristic \(p\). Theorem 2.4 also contains an explicit formula for \(L_{c,r}^{-1}\) when it exists. This result is used in order to construct a class of complete mappings (i.e., permutation polynomials \(f\in \mathbb{F}_q [x]\) such that \(f(x)+x\) also permutes \(\mathbb {F}_{q}\)) for which the computational inverse is again explicitly obtained. A recursive construction of a set of complete mappings with the property that the difference of any two distinct elements permutes \(\mathbb {F}_{q}\) is also given.
    0 references
    0 references
    permutation polynomials
    0 references
    complete mappings
    0 references
    compositional inverse
    0 references
    linearized polynomials
    0 references
    finite fields
    0 references
    binomial
    0 references
    trace
    0 references
    0 references

    Identifiers