2000 character limit reached
Character Sums and Deterministic Polynomial Root Finding in Finite Fields (1308.4803v2)
Published 22 Aug 2013 in math.NT and cs.CC
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$.