Character Sums and Deterministic Polynomial Root Finding in Finite Fields

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$.