Kloosterman sums, elliptic curves, and irreducible polynomials with prescribed trace and norm
Marko Moisio

TL;DR
This paper investigates the number of irreducible polynomials with specific trace and norm in finite fields, improves bounds on element counts, and explores properties of Kloosterman sums, providing new bounds and proofs.
Contribution
It offers new bounds for irreducible polynomials with prescribed coefficients and characterizes Kloosterman sums, extending previous results and simplifying existing proofs.
Findings
Improved bounds for the number of irreducible polynomials with prescribed trace and norm.
Sharp bounds for elements in finite fields with given trace and norm.
Characterization of Kloosterman sums divisible by three over ^r.
Abstract
Let () be a finite field. In this paper the number of irreducible polynomials of degree in with prescribed trace and norm coefficients is calculated in certain special cases and a general bound for that number is obtained improving the bound by Wan if is small compared to . As a corollary, sharp bounds are obtained for the number of elements in with prescribed trace and norm over improving the estimates by Katz in this special case. Moreover, a characterization of Kloosterman sums over divisible by three is given generalizing the earlier result by Charpin, Helleseth, and Zinoviev obtained only in the case odd. Finally, a new simple proof for the value distribution of a Kloosterman sum over the field , first proved by Katz and Livne, is given.
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.
