A general method for finding the compositional inverses of permutations from the AGW criterion

04/27/2020
by   Tailin Niu, et al.
0

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 unified approach to find these inverses of permutation polynomials constructed by the AGW criterion.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/15/2019

Constructions and necessities of some permutation polynomials

Permutation polynomials over finite fields have important applications i...
research
06/21/2019

Some results about permutation properties of a kind of binomials over finite fields

Permutation polynomials have many applications in finite fields theory, ...
research
12/21/2017

A Recursive Construction of Permutation Polynomials over F_q^2 with Odd Characteristic from Rédei Functions

In this paper, we construct two classes of permutation polynomials over ...
research
07/29/2020

On the constructions of n-cycle permutations

Any permutation polynomial is an n-cycle permutation. When n is a specif...
research
04/30/2022

Local permutation polynomials and the action of e-Klenian groups

Permutation polynomials of finite fields have many applications in Codin...
research
07/21/2022

More constructions of n-cycle permutations

n-cycle permutations with small n have the advantage that their composit...
research
02/14/2022

Permutation invariant matrix statistics and computational language tasks

The Linguistic Matrix Theory programme introduced by Kartsaklis, Ramgool...

Please sign up or login with your details

Forgot password? Click here to reset