Some new classes of permutation polynomials and their compositional inverses
Let \(p\) be a prime and \(q\) a power of \(p\). Let \(\mathbb{F}_q\) be the finite field with \(q\) elements, \(\mathbb{F}_q^*\) the multiplicative cyclic group of all non-zero elements of \(\mathbb{F}_q\), and \(\mathbb{F}_q[X]\) the ring of polynomials in \(X\) over \(\mathbb{F}_q\). A polynomial \(f\in \mathbb{F}_q[X]\) is called a \textit{permutation polynomial} (PP) of \(\mathbb{F}_q\) if the associated mapping \(c\mapsto f(c)\) from \(\mathbb{F}_q\) to \(\mathbb{F}_q\) is a permutation of \(\mathbb{F}_q\). The unique polynomial denoted by \(f^{-1}(X)\) over \(\mathbb{F}_q\) such that \(f(f^{-1}(X))\equiv f^{-1}(f(X))\equiv X\pmod{X^q-X}\) is called the compositional inverse of \(f(X)\). Furthermore, \(f(X)\) is called an involution if \(f^{-1}(X)=f(X)\).\N\NThe study of permutation polynomials and their compositional inverses over finite fields in terms of their coefficients is a classical and difficult subject which attracts people's interest partially due to their wide applications in coding theory, cryptography, combinatorial design theory, and other areas of mathematics and engineering. For instance, in block ciphers, a permutation polynomial is usually used as an S-box to build the confusion layer and the compositional inverse of S-box comes into picture while decrypting the cipher. Both the permutation polynomial and its compositional inverse are implemented. Therefore, the explicit and efficient permutation polynomial and its compositional inverse are desired for designers. Indeed, the better understanding of permutation polynomials and their compositional inverses in explicit format is not only meaningful, but also important for these applications.\N\NIn 2003, \textit{T. Helleseth} and \textit{V. Zinoviev} [Finite Fields Appl. 9, No. 2, 187--193 (2003; Zbl 1081.11077)] studied PPs of the form \(\Big(\frac{1}{X^2+X+\delta}\Big)^{2^\ell}+X\) to establish new Kloosterman sums identities over \(\mathbb{F}_{2^m}\), where \(\ell \in \{0,1\}\) and \(\delta \in \mathbb{F}_{2^m}\). Inspired by their work, Yuan and Ding initiated an investigation for PPs of the form \(f_1(X):=(X^{p^i}-X+\delta)^s+L(X)\) over \(\mathbb{F}_q\), where \(i,s\) are positive integers, \(\delta \in \mathbb{F}_q\) and \(L(X):=\sum_{i=0}^{m-1}\,\alpha_iX^{p^i}\) is a linearized polynomial in \(\mathbb{F}_q[X]\). The study of permutation polynomials of the shape \(f_1(X)\) may be divided into two specific types of PPs, namely, \(f_2(X):=(X^{p^i}-X+\delta)^{s_1}+(X^{p^i}-X+\delta)^{s_2}+X\), and \(f_3(X):=(\text{Tr}_m^n(X)+\delta)^s+L(X)\), where \(s_1, s_2, s, i, n, m\) are positive integers such that \(m\,|\,n\) and \(\delta \in \mathbb{F}_q\).\N\NIn [Finite Fields Appl. 35, 36--51 (2015; Zbl 1327.05009)], \textit{X. Zeng} et al. explored PPs of the form \(f_3(X)\) over finite fields of characteristic 2, where \(\delta \in \mathbb{F}_{2^n}\), \(L(X)=\text{Tr}_m^n(X)+X\) or \(X\), and the exponent \(s\) satisfies either of the two conditions: \(s(2^m+1)\equiv 2^m+1\pmod{2^n-1}\) or \(s(2^m-1)\equiv 2^m-1\pmod{2^n-1}\).\N\NIn the paper under review, the authors explore the PPs of the form \(f_3(X)\) over \(\mathbb{F}_{q^3}\), where \(\mathbb{F}_q\) is a finite field with arbitrary characteristic, \(L(X)\) is a linearized polynomial with non-trivial coefficients, and \(\delta =0\). In fact, they construct six new classes of PPs of the form \(f_3(X)\) over \(\mathbb{F}_{q^3}\) by employing the technique proposed by \textit{D. Wu} and \textit{P. Yuan} [Des. Codes Cryptography 92, No. 2, 267--276 (2024; Zbl 1555.11191)]. For every new class of PPs introduced in the paper, the authors provide explicit expressions for their compositional inverses.
- A family of skew Hadamard difference sets
- A method for obtaining digital signatures and public-key cryptosystems
- [[:Publication:5386086|A Note on a Class of Quadratic Permutations over ${\mathbb F}_Template:2^n$]]
- A survey of compositional inverses of permutation polynomials over finite fields
- Complete permutation polynomials with the form \((x^{p^m} - x + \delta)^s + a x^{p^m} + b x\) over \(\mathbb{F}_{p^n}\)
- Compositional inverses of permutation polynomials of the form x^rh(x^s) over finite fields
- Four classes of permutation polynomials of \(\mathbb F_{2^m}\)
- Further results on a class of permutation polynomials over finite fields
- Further results on permutation polynomials and complete permutation polynomials over finite fields
- scientific article; zbMATH DE number 426128 (Why is no real title available?)
- Large classes of permutation polynomials over \(\mathbb {F}_{q^2}\)
- Linearized polynomials over finite fields revisited
- Local Method for Compositional Inverses of Permutational Polynomials
- New Kloosterman sums identities over \(\mathbb F_{2^m}\) for all \(m\).
- On constructing permutations of finite fields
- On the inverses of some classes of permutations of finite fields
- Optimal Ternary Cyclic Codes From Monomials
- Permutation polynomials \((x^{p^m} - x + \delta)^{s_1} +(x^{p^m} - x + \delta)^{s_2} + x\) over \(\mathbb{F}_{p^n}\)
- Permutation polynomials and applications to coding theory
- Permutation polynomials and their compositional inverses over finite fields by a local method
- Permutation polynomials from trace functions over finite fields
- Permutation polynomials of the \((x^p - x+\delta)^s+L(x)\)
- Permutation polynomials over \(\mathbb{F}_{2^n}\) of the form \((x^{2^i} + x + \delta)^{s_1} +(x^{2^i} + x + \delta)^{s_2} + x\)
- Permutation polynomials over finite fields from a powerful lemma
- Permutation trinomials over \(\mathbb{F}_{2^m}\)
- Several classes of permutation polynomials based on the AGW criterion over the finite field \(\mathbb{F}_{2^{2m}}\)
- Several classes of permutation polynomials over the finite field \(\mathbb{F}_{p^{2 m}}\)
- Some classes of permutation polynomials of the form \((x^{p^m}-x+\delta)^s+x\) over \(\mathbb{F}_{p^{2m}}\)
- Some new forms of permutation polynomials based on the AGW criterion
- Some results on complete permutation polynomials and mutually orthogonal Latin squares
- The analytic representation of substitutions on a power of a prime number of letters with a discussion of the linear group. I, II.
- Two classes of permutation polynomials over finite fields
- Two new permutation polynomials with the form \({\left(x^{2^k}+x+\delta\right)^{s}+x}\) over \({\mathbb{F}_{2^n}}\)
This page was built for publication: Some new classes of permutation polynomials and their compositional inverses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6939567)
