Several Classes of Permutation Trinomials From Niho Exponents
Nian Li, Tor Helleseth

TL;DR
This paper constructs new classes of permutation trinomials over finite fields of characteristic two using Niho exponents, expanding the known families of such polynomials with potential applications in cryptography and coding theory.
Contribution
It introduces several novel classes of permutation trinomials over _{2^n} derived from Niho exponents, based on solving low-degree equations.
Findings
Multiple new permutation trinomial classes are constructed.
The methods involve subtle manipulations of equations over finite fields.
Results contribute to the understanding of permutation polynomials in characteristic two.
Abstract
Motivated by recent results on the constructions of permutation polynomials with few terms over the finite field , where is a positive even integer, we focus on the construction of permutation trinomials over from Niho exponents. As a consequence, several new classes of permutation trinomials over are constructed from Niho exponents based on some subtle manipulation of solving equations with low degrees over finite fields.
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.
