On a Type of Permutation Rational Functions over Finite Fields
Xiang-dong Hou, Christopher Sze

TL;DR
This paper investigates a specific class of permutation rational functions over finite fields, establishing conditions under which they permute the fields and demonstrating that for larger fields, they generally do not.
Contribution
The paper extends previous results by analyzing permutation properties of the functions for larger prime powers and provides new conditions for permutation behavior in specific cases.
Findings
For p=2,3, the functions permute all finite fields.
For p>3 and n≥5, the functions do not permute the fields.
For p>3 and n=2, permutation occurs iff the trace condition is met.
Abstract
Let be a prime and be a positive integer. Let , where is such that . In 2008, Yuan et al. \cite{Yuan-Ding-Wang-Pieprzyk-FFA-2008} showed that for , permutes for all . Using the Hasse-Weil bound, we show that when and , does not permute . For and , we prove that permutes if and only if . We conjecture that for and , does not permute .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Analytic Number Theory Research · Algebraic Geometry and Number Theory
