2000 character limit reached
On a Type of Permutation Rational Functions over Finite Fields
Published 26 Oct 2019 in math.NT | (1910.11989v2)
Abstract: Let $p$ be a prime and $n$ be a positive integer. Let $f_b(X)=X+(Xp-X+b){-1}$, where $b\in\Bbb F_{pn}$ is such that $\text{Tr}{pn/p}(b)\ne 0$. In 2008, Yuan et al. \cite{Yuan-Ding-Wang-Pieprzyk-FFA-2008} showed that for $p=2,3$, $f_b$ permutes $\Bbb F{pn}$ for all $n\ge 1$. Using the Hasse-Weil bound, we show that when $p>3$ and $n\ge 5$, $f$ does not permute $\Bbb F_{pn}$. For $p>3$ and $n=2$, we prove that $f_b$ permutes $\Bbb F_{p2}$ if and only if $\text{Tr}{p2/p}(b)=\pm 1$. We conjecture that for $p>3$ and $n=3,4$, $f_b$ does not permute $\Bbb F{pn}$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.