Recognition: unknown
Character Sums and Deterministic Polynomial Root Finding in Finite Fields
classification
🧮 math.NT
cs.CC
keywords
boundcharacterfindingobtainsumsalgorithmscertaindeterministic
read the original abstract
We obtain a new bound of certain double multiplicative character sums. We use this bound together with some other previously obtained results to obtain new algorithms for finding roots of polynomials modulo a prime $p$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.