Determination of Some Types of Permutations over $\mathbb{F}_q^2$ with Low-Degree
Xuan Pang, Yangcheng Li, Pingzhi Yuan, Yuanpeng Zeng

TL;DR
This paper systematically classifies low-degree permutation polynomial systems over finite fields, providing explicit characterizations and resolving key cases in the theory of permutation polynomials.
Contribution
It offers a complete classification of quadratic and certain 3-homogeneous permutation polynomial systems over finite fields, including explicit permutation binomials.
Findings
Complete classification of quadratic permutation polynomial systems
Full classification of 3-homogeneous permutation polynomial systems
Explicit characterization of specific permutation binomials
Abstract
The characterization of permutations over finite fields is an important topic in number theory with a long-standing history. This paper presents a systematic investigation of low-degree bivariate polynomial systems defined over . Specifically, we employ Hermite's Criterion to completely classify bivariate quadratic permutation polynomial systems, while utilizing the theory of permutation rational functions to give a full classification of bivariate 3-homogeneous permutation polynomial systems. Furthermore, as an application of our findings, we provide an explicit characterization of the permutation binomials of the form over with characteristic , thereby resolving a significant special case within this classical research domain.
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 · Polynomial and algebraic computation · Cryptography and Residue Arithmetic
