New Results on Permutation Binomials of Finite Fields
Xiang-dong Hou, Vincenzo Pallozzi Lavorante

TL;DR
This paper investigates permutation binomials over finite fields, introduces an equivalence notion, and proves new nonexistence results for specific binomials, partially confirming a recent conjecture and extending prior work.
Contribution
It introduces an equivalence framework for permutation binomials and establishes new nonexistence results for certain binomials over finite fields.
Findings
Proves nonexistence of certain permutation binomials over large finite fields.
Partially confirms a recent conjecture by Tu et al.
Extends previous results to new classes of binomials.
Abstract
After a brief review of existing results on permutation binomials of finite fields, we introduce the notion of equivalence among permutation binomials (PBs) and describe how to bring a PB to its canonical form under equivalence. We then focus on PBs of of the form , where and are positive integers and . Our contributions include two nonexistence results: (1) If is even and sufficiently large and , then is not a PB of . (2) If , is sufficiently large and , then is not a PB of under certain additional conditions. (1) partially confirms a recent conjecture by Tu et al. (2) is an extension of a previous result with .
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 · Cryptographic Implementations and Security · graph theory and CDMA systems
