## Discrete logarithms in gf(p) using the number field sieve (1993)

by
Daniel M. Gordon

Venue: | SIAM J. Discrete Math |

Citations: | 63 - 1 self |

### BibTeX

@ARTICLE{Gordon93discretelogarithms,

author = {Daniel M. Gordon},

title = {Discrete logarithms in gf(p) using the number field sieve},

journal = {SIAM J. Discrete Math},

year = {1993},

volume = {6},

pages = {124--138}

}

### Years of Citing Articles

### OpenURL

### Abstract

Recently, several algorithms using number field sieves have been given to factor a number n in heuristic expected time Ln[1/3; c], where Ln[v; c] = exp{(c + o(1))(log n) v (log log n) 1−v}, for n → ∞. In this paper we present an algorithm to solve the discrete logarithm problem for GF (p) with heuristic expected running time Lp[1/3; 3 2/3]. For numbers of a special form, there is an asymptotically slower but more practical version of the algorithm.