Regular complete permutation polynomials over quadratic extension fields
Let \(\mathbb{F}_q\) be a finite field of \(q\) elements, where \(q\) is a prime power of the prime \(p\). A polynomial \(f(x)\in\mathbb{F}_q[x]\) is called a permutation polynomial (PP) over \(\mathbb{F}_q\) if the polynomial \(f\) induces a bijective map from \(\mathbb{F}_q\) to itself. If both \(f(x)\) and \(f(x)+x\) are permutation polynomials over \(\mathbb{F}_q\), the polynomial \(f(x)\) is called a complete permutation polynomial (CPP) over \(\mathbb{F}_q\). For any integer \(n\ge0\), \(f^{(n)}\) is defined recursively such as \(f^{(n)}=f\circ f^{(n-1)}=f^{(n-1)}\circ f\) with \(f^{(0)}=e\), the identity map and \(f^{(1)}=f\), the permutation polynomial itself. For any negative integer \(n\), \(f^{(n)}=(f^{-1})^{(-n)}\). The polynomial \(f(x)\) is called an \(n\)-cycle permutation if \(f^{(n)}\) equals to the identity map \(e\). A polynomial \(f(x)\in\mathbb{F}_q[x]\) is called \textit{r-regular} PP if \(f\) is a PP over \(\mathbb{F}_q\) with all the cycles of the length \(r\) except the cycles contain the fixed points.\N\NIn this paper, the authors give two constructions of \textit{r-regular} CPPs over quadratic extension fields \(\mathbb{F}_{q^2}\), where the integer \(r\ge3\), \(\gcd(r,q)=1\) and \(q^2\equiv 1\pmod r\). If \(h(t)\in\mathbb{F}_q[x]\) is a quadratic polynomial of order \(r\) which is the characteristic polynomial of a linear operator \(\sigma_M\) of \(\mathbb{F}_{q^2}\), then \(\sigma\) is a PP over \(\mathbb{F}_{q^2}\) given by \(\sigma=\tau_1\circ \sigma_M\circ \tau_2\), where both \(\tau_1, \tau_2\) are PPs over \(\mathbb{F}_{q^2}\) and \(M\) is the matrix of \(\sigma_M\) of order \(2\) over \(\mathbb{F}_q\) with the determinant \(\text{det}(tI_2-M)=h(t)\). If \(\tau_1\circ \tau_2=e\), then \(\sigma\) is \textit{r-regular} PP over \(\mathbb{F}_{q^2}\). In addition, if \(\tau_1\) is additive and \(\tau_1\circ \tau_2=e\), then \(\sigma\) is \textit{r-regular} CPP over \(\mathbb{F}_{q^2}\).
- A general construction of regular complete permutation polynomials
- A note on complete polynomials over finite fields and their applications in cryptography
- A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
- Analysis of involutional ciphers: Khazad and Anubis.
- Block substitutions using orthomorphic mappings
- Constructing permutations and complete permutations over finite fields via subfield-valued polynomials
- Constructions of complete permutation polynomials
- Cycle structure of automorphisms of finite cyclic groups
- Cycle structure of permutation functions over finite fields and their applications
- Cycles of linear permutations over a finite field
- Dickson permutation polynomials that decompose in cycles of the same length
- scientific article; zbMATH DE number 3174791 (Why is no real title available?)
- scientific article; zbMATH DE number 5578168 (Why is no real title available?)
- scientific article; zbMATH DE number 3779459 (Why is no real title available?)
- scientific article; zbMATH DE number 61942 (Why is no real title available?)
- scientific article; zbMATH DE number 1088902 (Why is no real title available?)
- scientific article; zbMATH DE number 1504535 (Why is no real title available?)
- scientific article; zbMATH DE number 6900650 (Why is no real title available?)
- scientific article; zbMATH DE number 2124965 (Why is no real title available?)
- scientific article; zbMATH DE number 3422259 (Why is no real title available?)
- scientific article; zbMATH DE number 2238187 (Why is no real title available?)
- Investigations on Bent and Negabent Functions via the Nega-Hadamard Transform
- Loiss: A Byte-Oriented Stream Cipher
- New block encryption algorithm MISTY
- On generalized strong complete mappings and mutually orthogonal Latin squares
- On the Behaviors of Affine Equivalent Sboxes Regarding Differential and Linear Attacks
- On the constructions of n-cycle permutations
- On the need for multipermutations: Cryptanalysis of MD4 and SAFER
- Partitions of groups and complete mappings
- Regular complete permutation polynomials over \(\mathbb{F}_{2^n} \)
- Shapeless quasigroups derived by Feistel orthomorphisms
- The Construction of Orthogonal Latin Squares
This page was built for publication: Regular complete permutation polynomials over quadratic extension fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7026844)