You are not currently logged in.
Access your personal account or get JSTOR access through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Searching for Primitive Roots in Finite Fields
Mathematics of Computation
Vol. 58, No. 197 (Jan., 1992), pp. 369-380
Published by: American Mathematical Society
Stable URL: http://www.jstor.org/stable/2153041
Page Count: 12
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
Let GF(pn) be the finite field with pn elements, where p is prime. We consider the problem of how to deterministically generate in polynomial time a subset of GF(pn) that contains a primitive root, i.e., an element that generates the multiplicative group of nonzero elements in GF(pn). We present three results. First, we present a solution to this problem for the case where p is small, i.e., p = nO(1). Second, we present a solution to this problem under the assumption of the Extended Riemann Hypothesis (ERH) for the case where p is large and n = 2. Third, we give a quantitative improvement of a theorem of Wang on the least primitive root for GF(p), assuming the ERH.
Mathematics of Computation © 1992 American Mathematical Society