The compositional inverses of permutation polynomials from trace functions over finite fields
Danyao Wu, Pingzhi Yuan

TL;DR
This paper derives the compositional inverses of certain permutation polynomials over finite fields, specifically those involving trace functions and polynomial functions satisfying particular algebraic conditions.
Contribution
It provides explicit formulas for the inverses of a broad class of permutation polynomials involving trace functions and polynomial conditions over finite fields.
Findings
Explicit inverse formulas for permutation polynomials involving trace functions.
Conditions under which the permutation polynomials are invertible.
Application of the results to construct permutation polynomials with known inverses.
Abstract
In this paper, we present the compositional inverses of several classes permutation polynomials of the form , where are positive integers, is a prime and is a polynomial over satisfying the following conditions: (i) where is a polynomial over (ii) For any is injective on
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · semigroups and automata theory
