The large-order conjecture for Kummer field generators

Let qq be a prime power and let Fqn\textbf{F}_{q^n} be a finite field. Let gFqng\in\textbf{F}_{q^n} satisfy the conditions in Theorem~, and suppose that nlogqn\geq\log q. Large-order conjecture. The order of gg is greater than

qn/cq^{n/c}

for an absolute constant cc. Numerical evidence suggests that the order of gg is close to the group order qn1q^n-1, and proving a large order would address a principal obstacle in improving the efficiency of AKS-style primality-testing algorithms. The conjecture concerns the generator produced in the paper's Kummer-field construction; its status is not resolved in the supplied text.

Sources & referencesView supporting material

Primary source

Qi Cheng, “On the Bounded Sum-of-digits Discrete Logarithm Problem in Kummer and Artin-Schreier Extensions”, arXiv:math/0311120 (2003).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.