Multiplicative character sums over two classes of subsets of quadratic extensions of finite fields
Kaimin Cheng, Arne Winterhof

TL;DR
This paper improves bounds on multiplicative character sums over special subsets of quadratic extensions of finite fields, enabling better results on the existence of primitive elements within these subsets.
Contribution
The authors develop sharper estimates for character sums over subsets of finite field extensions by reducing the problem to sums over subfields, enhancing previous bounds.
Findings
Sharper bounds for character sums over quadratic extension subsets
Reduction of sums to subfield sums for improved estimates
Application to prove existence of primitive elements in subsets
Abstract
Let be a prime power and a positive even integer. Let be the finite field with elements and be its extension field of degree . Let be a nontrivial multiplicative character of and a polynomial over with a simple root in . In this paper, we improve estimates for character sums , where is either a subset of of sparse elements, with respect to some fixed basis of which contains a basis of , or a subset avoiding affine hyperplanes in general position. While such sums have been previously studied, our approach yields sharper bounds by reducing them to sums over the subfield rather than sums over general linear spaces. These estimates can…
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 · Finite Group Theory Research · Cryptography and Residue Arithmetic
