首页/论文/2004.12552

arXiv 2004.125522020-04cs.ITmath.ITmath.NT

Finding compositional inverses of permutations from the AGW criterion

Tailin Niu, Kangquan Li, Longjiang Qu, Qiang Wang

备注：: 24 pages. Revision submitted
DOI：: 10.1109/TIT.2021.3089145

英文摘要：

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.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Compositional Inverses of AGW-PPs

In this paper, we present two methods to obtain the compositional inverses of AGW-PPs. We improve some known results in this topic.

2022-03-01cs.ITmath.IT

New Constructions of Permutation Polynomials of the Form $x^rh\left(x^{q-1}\right)$ over $\mathbb{F}_{q^2}$

Permutation polynomials over finite fields have been studied extensively recently due to their wide applications in cryptography, coding theory, communication theory, among others. Recently, several authors have studied permutation trinomials of the form $x^rh\left(x^{q-1}\right)$ over $\mathbb{F}_{q^2}$, where $q=2^k$, $h(x)=1+x^s+x^t$ and $r, s, t, k>0$ are integers. Their methods are essentially usage of a multiplicative version of AGW Criterion because they all transformed the problem of proving permutation polynomials over $\mathbb{F}_{q^2}$ into that of showing the corresponding fraction…

2017-08-03cs.ITmath.IT

新型迹形式置换多项式及其复合逆

New classes of trace-form permutation polynomials and their compositional inverses

University of Rouen Normandy（诺曼底鲁昂大学）

该研究在有限域F_{q^2}上构造两类系数覆盖全域的迹形式置换多项式，计算其复合逆，所用Kloosterman和与有限域方程分析技术具独立研究价值。

2026-09-02cs.ITmath.ITmath.NT

关于有限域上几类置换的逆

On the inverses of some classes of permutations of finite fields

研究了有限域上几类一般置换多项式的合成逆。我们表明，我们可以写这些逆的逆的有限域，其中之一是一个线性化的多项式的子空间中的另外两个多项式bipoting。在某些情况下，我们能够显式地获得这些逆，从而获得所讨论的置换的合成逆。此外，我们展示了如何计算一个线性多项式诱导的逆映射的子空间上的一个规定的线性多项式诱导双射。我们还得到了两类置换多项式的显式合成逆，推广了最近分别在[22]和[24]中得到的合成逆。

2013-10-31cs.ITmath.ITmath.NT

More constructions of $n$-cycle permutations

$n$-cycle permutations with small $n$ have the advantage that their compositional inverses are efficient in terms of implementation. They can be also used in constructing Bent functions and designing codes. Since the AGW Criterion was proposed, the permuting property of several forms of polynomials has been studied. In this paper, characterizations of several types of $n$-cycle permutations are investigated. Three criteria for $ n $-cycle permutations of the form $xh(λ(x))$, $ h(ψ(x)) φ(x)+g(ψ(x)) $ and $g\left( x^{q^i} -x +δ\right) +bx $ with general $n$ are provided. We demonstrate these cri…

2022-08-05cs.ITmath.IT

复合逆，完备映射，正交拉丁方和Bent函数

Compositional inverses, complete mappings, orthogonal Latin squares and bent functions

我们研究置换多项式，完全映射，相互正交拉丁方和弯曲向量函数的合成逆。最近在[33]中得到了有限域上线性化置换二项式的合成逆。在[29]中还注意到，计算子空间的双射的逆可以应用于确定与线性化多项式相关的某些置换类的合成逆。本文给出了一类置换迹映射核的线性化二项式的合成逆。作为这个结果的应用，我们给出了一类完全映射的合成逆。这个完全映射类改进了[34]中给出的一个最近的构造。我们还递归地构造了一类涉及多迹函数的完全映射。最后利用这些完全映射导出了一组相互正交拉丁方，并从Maiorana-McFarland类构造了一类$p$ -元bent向量函数.

2014-09-23cs.ITmath.COmath.IT

更多相关论文收起更多论文

A New Method of Construction of Permutation Trinomials with Coefficients 1

Permutation polynomials over finite fields are an interesting and constantly active research subject of study for many years. They have important applications in areas of mathematics and engineering. In recent years, permutation binomials and permutation trinomials attract people's interests due to their simple algebraic forms. In this paper, by reversely using Tu's method for the characterization of permutation polynomials with exponents of Niho type, we propose a new method to construct permutation trinomials with coefficients 1. Moreover, we give the explicit compositional inverses of a cla…

2022-04-29cs.ITmath.COmath.IT

Permutations via linear translators

We show that many infinite classes of permutations over finite fields can be constructed via translators with a large choice of parameters. We first charac- terize some functions having linear translators, based on which several families of permutations are then derived. Extending the results of [10], we give in several cases the compositional inverse of these permutations. The connection with complete permutations is also utilized to provide further infinite classes of permutations. Moreover, we propose new tools to study permutations of the form x is mapped to x+(x^(p^m) - x+ lambda)^s and a…

2016-12-12cs.ITmath.IT

基于Rédei函数的奇特征$\mathbb{F}_{q^2}$上置换多项式的递归构造

A Recursive Construction of Permutation Polynomials over $\mathbb{F}_{q^2}$ with Odd Characteristic from Rédei Functions

本文利用有理Rédei函数递归构造了奇特征$\mathbb{F}_{q^2}$上的两类置换多项式，完整刻画了其合成逆，并给出了易于验证的置换条件及若干二项式、三项式实例，发现此类多项式数量庞大。

2017-12-21cs.ITmath.COmath.IT

Construction of APN permutations via Walsh zero spaces

A Walsh zero space (WZ space) for $f:F_{2^n}\rightarrow F_{2^n}$ is an $n$-dimensional vector subspace of $F_{2^n}\times F_{2^n}$ whose all nonzero elements are Walsh zeros of $f$. We provide several theoretical and computer-free constructions of WZ spaces for Gold APN functions $f(x)=x^{2^i+1}$ on $F_{2^n}$ where $n$ is odd and $\gcd(i,n)=1$. We also provide several constructions of trivially intersecting pairs of such spaces. We illustrate applications of our constructions that include constructing APN permutations that are CCZ equivalent to $f$ but not extended affine equivalent to $f$ or i…

2021-10-29cs.ITmath.IT

$n-$圈置换多项式的更多构造

Some more constructions of $n-$cycle permutation polynomials

本文研究了$n-$圈置换多项式的构造，提出了利用线性化多项式$L(x)$构造更大$n$的置换准则，推广了新形式，并构造了多种显式置换多项式。

2025-06-27cs.ITmath.COmath.IT

一类平移不变置换及其代数结构

Shift-Invariant Permutations with Polynomial Composition: Construction and Algebraic Structure

Hubei University（湖北大学）；Key Laboratory of Applied Mathematics, Faculty of Mathematics and Statistics, Hubei University（湖北大学数学与统计学院应用数学重点实验室）；Key Laboratory of Intelligent Sensing System and Security (Hubei University), Ministry of Education（教育部智能感知系统与安全防护重点实验室（湖北大学））；Institute of Information Engineering, Chinese Academy of Sciences（中国科学院信息工程研究所）

本文研究由递归映射序列生成的平移不变置换，给出其多项式复合性质的充要条件，建立与商环单位群的同构，并将置换性质归约为多项式计算，统一了百余种构造。

2026-10-16cs.ITmath.IT