Character sums and deterministic polynomial root finding in finite fields

Jean Bourgain, Sergei V. Konyagin, Igor E. Shparlinski

Research output: Contribution to journalArticlepeer-review

7 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)2969-2977
Number of pages9
JournalMathematics of Computation
Volume84
Issue number296
DOIs
Publication statusPublished - 2015
Externally publishedYes

Keywords

  • Character sums
  • Finite field
  • Multiplicative energy
  • Root finding

Fingerprint Dive into the research topics of 'Character sums and deterministic polynomial root finding in finite fields'. Together they form a unique fingerprint.

Cite this