Finding Compositional Inverses of Permutations From the AGW Criterion

DOI10.1109/TIT.2021.3089145MaRDI QIDQ4958199zbMATH OpenOpenAlexFDO

Authors Tailin Niu, Kangquan Li, Longjiang Qu, Qiang Wang

Publication date 7 September 2021

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2004.12552

zbMATH Keywords

AGW criterioninverses of permutation polynomials

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

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.

Cited in

(16)

• 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
• 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
• Constructing permutation polynomials over \(\mathbb{F}_{q^3}\) from bijections \(\mathrm{PG}(2,q)\)
• Constructing permutation polynomials from permutation polynomials of subfields
• Three classes of permutation quadrinomials in odd characteristic
• Some new classes of permutation pentanomials and hexanomials over \(\mathbb{F}_{q^3}\) with even characteristic
• The compositional inverses of the permutation polynomials from trace functions over finite fields
• Algebraic structure of permutational polynomials over Fqn
• The study on three classes of permutation quadrinomials over finite fields of odd characteristic
• 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
• Injective systems for permutation polynomials over finite fields

This page was built for publication: Finding Compositional Inverses of Permutations From the AGW Criterion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4958199)