Character Sums and Deterministic Polynomial Root Finding in Finite Fields
Number Theory
2014-03-12 v2 Computational Complexity
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 .
Cite
@article{arxiv.1308.4803,
title = {Character Sums and Deterministic Polynomial Root Finding in Finite Fields},
author = {Jean Bourgain and Sergei Konyagin and Igor Shparlinski},
journal= {arXiv preprint arXiv:1308.4803},
year = {2014}
}