English

On a Type of Permutation Rational Functions over Finite Fields

Number Theory 2020-01-07 v2

Abstract

Let pp be a prime and nn be a positive integer. Let fb(X)=X+(XpX+b)1f_b(X)=X+(X^p-X+b)^{-1}, where bFpnb\in\Bbb F_{p^n} is such that Trpn/p(b)0\text{Tr}_{p^n/p}(b)\ne 0. In 2008, Yuan et al. \cite{Yuan-Ding-Wang-Pieprzyk-FFA-2008} showed that for p=2,3p=2,3, fbf_b permutes Fpn\Bbb F_{p^n} for all n1n\ge 1. Using the Hasse-Weil bound, we show that when p>3p>3 and n5n\ge 5, ff does not permute Fpn\Bbb F_{p^n}. For p>3p>3 and n=2n=2, we prove that fbf_b permutes Fp2\Bbb F_{p^2} if and only if Trp2/p(b)=±1\text{Tr}_{p^2/p}(b)=\pm 1. We conjecture that for p>3p>3 and n=3,4n=3,4, fbf_b does not permute Fpn\Bbb F_{p^n}.

Keywords

Cite

@article{arxiv.1910.11989,
  title  = {On a Type of Permutation Rational Functions over Finite Fields},
  author = {Xiang-dong Hou and Christopher Sze},
  journal= {arXiv preprint arXiv:1910.11989},
  year   = {2020}
}

Comments

7 pages

R2 v1 2026-06-23T11:55:30.593Z