Name
Title | ||
|---|---|---|
Compositional inverses of permutation polynomials of the form <Emphasis Type="Italic">x</Emphasis><Superscript><Emphasis Type="Italic">r</Emphasis></Superscript><Emphasis Type="Italic">h</Emphasis>(<Emphasis Type="Italic">x</Emphasis><Superscript><Emphasis Type="Italic">s</Emphasis></Superscript>) over finite fields |
Abstract | ||
|---|---|---|
The study of computing compositional inverses of permutation polynomials over finite fields efficiently is motivated by an open problem proposed by G. L. Mullen (1991), as well as the potential applications of these permutation polynomials (Dillon 1974, Khachatrian and Kyureghyan, Discrete Appl. Math. 216, 622–626 2017, Lidl 1985, Lidl and Müller 1984, Rivest et al., ACM Commun. Comput. Algebra. 1978, 120–126 1976, Schwenk and Huber, Electron. Lett. 34, 759–760 1998). It is well known that every permutation polynomial over a finite field \(\mathbb {F}_{q}\) can be reduced to a permutation polynomial of the form xrh(xs) with s∣(q − 1) and \(h(x) \in \mathbb {F}_{q}[x]\) (Akbary et al., Finite Fields Appl. 15(2), 195–206 2009, Wang, Finite Fields Appl. 22, 57–69 2013). Recently, several explicit classes of permutation polynomials of the form xrh(xs) over \({\mathbb F}_{q}\) have been constructed. However, all the known methods to compute the compositional inverses of permutation polynomials of this form seem to be inadequately explicit, which could be a hurdle to potential applications. In this paper, for any prime power q, we introduce a new approach to explicitly compute the compositional inverse of a permutation polynomial of the form xrh(xs) over \({\mathbb F}_{q}\), where s∣(q − 1) and \(\gcd (r,q-1)= 1\). The main idea relies on transforming the problem of computing the compositional inverses of permutation polynomials over \({\mathbb F}_{q}\) into computing the compositional inverses of two restricted permutation mappings, where one of them is a monomial over \(\mathbb {F}_{q}\) and the other is the polynomial xrh(x)s over a particular subgroup of \(\mathbb {F}_{q}^{*}\) with order (q − 1)/s. This is a multiplicative analog of Tuxanidy and Wang (Finite Fields Appl. 28, 244–281 2014), Wu and Liu (Finite Fields Appl. 24, 136–147 2013). We demonstrate that the inverses of these two restricted permutations can be explicitly obtained in many cases. As consequences, many explicit compositional inverses of permutation polynomials given in Zieve (Proc. Am. Math. Soc. 137, 2209–2216 2009), Zieve (arXiv:1310.0776, 2013), Zieve (arXiv:1312.1325v3, 2013) are obtained using this method. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/s12095-018-0292-7 | Cryptography and Communications |
Keywords | Field | DocType |
Finite fields, Permutation polynomials, Compositional inverses, 11T06 | Inverse,Discrete mathematics,Finite field,Combinatorics,Multiplicative function,Polynomial,Permutation,Monomial,Prime power,Mathematics,Permutation polynomial | Journal |
Volume | Issue | ISSN |
11 | 2 | 1936-2455 |
Citations | PageRank | References |
1 | 0.40 | 21 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kangquan Li | 1 | 42 | 7.56 |
| Longjiang Qu | 2 | 322 | 41.72 |
| Qiang Wang | 3 | 237 | 37.93 |