Finding compositional inverses of permutations from the AGW criterion

Abstract

Permutation polynomials and their compositional inverses have wide applications in cryptography, coding theory, and combinatorial designs. Motivated by several previous results on finding compositional inverses of permutation polynomials of different forms, we propose a general method for finding these inverses of permutation polynomials constructed by the AGW criterion. As a result, we have reduced the problem of finding the compositional inverse of such a permutation polynomial over a finite field to that of finding the inverse of a bijection over a smaller set. We demonstrate our method by interpreting several recent known results, as well as by providing new explicit results on more classes of permutation polynomials in different types. In addition, we give new criteria for these permutation polynomials being involutions. Explicit constructions are also provided for all involutory criteria.

24 pages. Revision submitted

References in corpus (8)

• Several Classes of Permutation Trinomials From Niho Exponents
• On Inverses of Permutation Polynomials of Small Degree over Finite Fields
• Large classes of permutation polynomials over ${\mathbb{F}}_{q^2}$
• On some permutation polynomials over F_q of the form x^r*h(x^((q-1)/d)))
• Piecewise constructions of inverses of cyclotomic mapping permutation polynomials
• On the constructions of $n$-cycle permutations
• Determination of a Type of Permutation Trinomials over Finite Fields, II
• On inverse of permutation polynomials of small degree over finite fields, II

Cited by in corpus (1)

• More constructions of $n$-cycle permutations