On a Type of Permutation Rational Functions over Finite Fields
Abstract
Let p be a prime and n be a positive integer. Let fb(X)=X+(Xp-X+b)-1, where b∈ Fpn is such that Trpn/p(b) 0. In 2008, Yuan et al. Yuan-Ding-Wang-Pieprzyk-FFA-2008 showed that for p=2,3, fb permutes Fpn for all n 1. Using the Hasse-Weil bound, we show that when p>3 and n 5, f does not permute Fpn. For p>3 and n=2, we prove that fb permutes Fp2 if and only if Trp2/p(b)= 1. We conjecture that for p>3 and n=3,4, fb does not permute Fpn.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.