A conjecture on permutation trinomials over finite fields of characteristic two
Nian Li, Qiaoyu Hu

TL;DR
This paper proves a recent conjecture about permutation trinomials over finite fields of characteristic two by analyzing quadratic factors of an 11th degree polynomial, settling a specific case where n=2m and gcd(m,5)=1.
Contribution
It provides a proof for a conjecture on permutation trinomials over finite fields of characteristic two, specifically for the case where n=2m and gcd(m,5)=1.
Findings
Conjecture on permutation trinomials is confirmed for specified parameters.
Analysis of quadratic factors is key to the proof.
Results contribute to understanding permutation polynomials over finite fields.
Abstract
In this paper, by analyzing the quadratic factors of an -th degree polynomial over the finite field , a conjecture on permutation trinomials over proposed very recently by Deng and Zheng is settled, where and is a positive integer 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 · Cryptography and Residue Arithmetic · Cryptographic Implementations and Security
