Classification of some permutation quadrinomials from self reciprocal polynomials over F₂^n
Motivated by several constructions of permutation polynomials done by several authors (most notably by \textit{M. E. Zieve} [Proc. Am. Math. Soc. 137, No. 7, 2209--2216 (2009; Zbl 1228.11177)], \textit{A. Akbary} et al. [Finite Fields Appl. 17, No. 1, 51--67 (2011; Zbl 1281.11102)] and \textit{R. Gupta} and \textit{R. K. Sharma} [Finite Fields Appl. 41, 89--96 (2016; Zbl 1372.11108)] the authors propose an unified treatment for a large set of classes of permutation polynomials of $\mathbb F_{q}$ [\textit{R. Gupta}, Des. Codes Cryptography 88, No. 1, 223--239 (2020; Zbl 1428.11203); Commun. Algebra 50, No. 1, 324--333 (2022; Zbl 1490.11116)]. Their approach yields a recipe for constructing several new and old classes of permutation polynomials of $\mathbb F_{q}$ [\textit{X.-d. Hou}, Contemp. Math. 632, 177--191 (2015; Zbl 1418.11153); \textit{Y. Laigle-Chapuy}, Finite Fields Appl. 13, No. 1, 58--70 (2007; Zbl 1107.11048); \textit{R. Lidl} and \textit{W. B. Müller}, in: Advances in cryptology. Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques (Crypto '83) held at the University of California, Santa Barbara, Calif., August 22--24, 1983. New York-London: Plenum Press. 293--301 (1984; Zbl 1487.94128)]. More precisely, let $\mathbb F_{q}$ be a finite field of order $q$. For $q$ even, authors give a simple way to construct small degree polynomials over $\mathbb F_{q}$ with no roots in the set $\mu_{q+1}=\{a\in F_{q^2}:a^{q+1}=1\}$ of the $(q+1)$-th roots of unity. Further, authors use these small degree polynomials over $\mathbb F_{q}$ to construct and classify certain new families of permutation quadrinomials over $\mathbb F_{q^2}$ [\textit{K. Li} et al., Finite Fields Appl. 66, Article ID 101690, 19 p. (2020; Zbl 1478.11146); \textit{F. Özbudak} and \textit{B. Gülmez Temür}, Des. Codes Cryptography 90, No. 7, 1537--1556 (2022; Zbl 1502.11117); \textit{Z. Tu} et al., Finite Fields Appl. 50, 304--318 (2018; Zbl 1380.05001); \textit{D. Wu} et al., Finite Fields Appl. 46, 38--56 (2017; Zbl 1431.11131)].
- A family of skew Hadamard difference sets
- A revisit to a class of permutation quadrinomials
- A survey of permutation binomials and trinomials over finite fields
- Classification of permutation polynomials of the form \(x^3g(x^{q-1})\) of \(\mathbb{F}_{q^2}\) where \(g(x)=x^3+bx+c\) and \(b, c \in\mathbb{F}_q^*\)
- Cyclotomic Mapping Permutation Polynomials over Finite Fields
- Further results on permutation trinomials over finite fields with even characteristic
- scientific article; zbMATH DE number 3882549 (Why is no real title available?)
- More classes of permutation quadrinomials from Niho exponents in characteristic two
- More results about a class of quadrinomials over finite fields of odd characteristic
- New permutation quadrinomials over \(\mathbb{F}_{2^{2m}}\)
- On a conjecture about a class of permutation quadrinomials
- On constructing permutations of finite fields
- On polynomials of the form \(x^{r}f(x^{(q - 1)/l})\)
- On some permutation polynomials over $\mathbb {F}_q$ of the form $x^r h(x^{(q-1)/d})$
- Optimal Ternary Cyclic Codes From Monomials
- Permutation polynomials and applications to coding theory
- Permutation polynomials and group permutation polynomials
- Permutation polynomials in RSA-cryptosystems
- Permutation polynomials of the form \(x^r f(x^{(q-1)/d)}\) and their group structure
- Permutation polynomials of the type \(x^rg(x^{s})\) over \({\mathbb {F}}_{q^{2n}}\)
- Permutation trinomials over \(\mathbb{F}_{2^m}\)
- Quartics over GF(2 n )
- Several new permutation quadrinomials over finite fields of odd characteristic
- Some new classes of permutation trinomials over finite fields with even characteristic
- Some permutation pentanomials over finite fields with even characteristic
- A class of permutation quadrinomials
- Four classes of permutation polynomials of \(\mathbb F_{2^m}\)
- Completely characterizing a class of permutation quadrinomials
- Exceptionality of \((X+1)^n + (X -1)^n\)
- Generating new classes of permutation polynomials
- Permutation polynomials with a few terms over finite fields
- Permutation polynomials of the form \(x^r h (x^{q-1})\) over \(\mathbb{F}_{q^2}\) with even characteristics
- Construction of permutation polynomials over finite fields with the help of SCR polynomials
This page was built for publication: Classification of some permutation quadrinomials from self reciprocal polynomials over \(\mathbb{F}_{2^n} \)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6136722)
