Paper 2026/1476
Constructing new permutation polynomials by the AGW Criterion
Abstract
In this paper, we propose several classes of permutation polynomials having the form $\sum\limits_i(x^{2^m}+x+\delta)^{s_i}+ax$ for $i=1$ or $i=2$, where the exponent $s_i$ satisfies $s_i\equiv 2^j\pmod{2^m+1}$ or $s_i \equiv 2^j\pmod{2^m-1}$ for some different integers $j$, $a\in\mathbb{F}_{2^m}^*$ and $\delta\in \mathbb{F}_{2^{2m}}$. More precisely, by applying the AGW criterion and determining the number of solutions to certain equations over $\mathbb{F}_{2^{2m}}$, several classes of permutation polynomials of the form $(x^{2^m}+x+\delta)^s+ax$ over $\mathbb{F}_{2^{2m}}$ are presented. In addition, we construct some classes of permutation polynomials of the form $(x^{2^m}+x+\delta)^{s_1}+(x^{2^m}+x+\delta)^{s_2}+ax$ over $\mathbb{F}_{2^{2m}}$. Our results generalize some known constructions of permutation polynomials. Finally, we demonstrate that the permutation polynomials proposed in this paper are not quasi-multiplicative equivalent to known ones.
Metadata
- Available format(s)
-
PDF
- Category
- Secret-key cryptography
- Publication info
- Preprint.
- Keywords
- Finite fieldPermutation polynomialAGW criterion.
- Contact author(s)
-
lqmova @ foxmail com
241020048 @ fzu edu cn
zhazhengbang @ 163 com
zhangjing_nudt @ 163 com - History
- 2026-07-23: approved
- 2026-07-20: received
- See all versions
- Short URL
- https://ia.cr/2026/1476
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2026/1476,
author = {Qian Liu and Liwei Fang and Zhengbang Zha and Jing Zhang},
title = {Constructing new permutation polynomials by the {AGW} Criterion},
howpublished = {Cryptology {ePrint} Archive, Paper 2026/1476},
year = {2026},
url = {https://eprint.iacr.org/2026/1476}
}