ProV Logo
0

On the discrete logarithm problem in fin...
Granger, Robert...
On the discrete logarithm problem in finite fields of fixed characteristic by Granger, Robert ( Author )
N.A
06-07-2015
For q a prime power, the discrete logarithm problem (DLP) in Fq consists in finding, for any g∈F×q and h∈⟨g⟩, an integer x such that gx=h. We present an algorithm for computing discrete logarithms with which we prove that for each prime p there exist infinitely many explicit extension fields Fpn in which the DLP can be solved in expected quasi-polynomial time. Furthermore, subject to a conjecture on the existence of irreducible polynomials of a certain form, the algorithm solves the DLP in all extensions Fpn in expected quasi-polynomial time.
-
Article
pdf
36.88 KB
English
-
MYR 0.00
-
https://arxiv.org/abs/1507.01495
Share this eBook