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

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

by Daniel M. Gordon

Venue:	SIAM J. Discrete Math
Citations:	51 - 1 self

Datum	Value	Source
TITLE	Discrete logarithms in gf(p) using the number field sieve	INFERENCE
AUTHOR NAME	Daniel M. Gordon	SVM HeaderParse 0.2
AUTHOR AFFIL	Department of Computer Science; University of Georgia	SVM HeaderParse 0.2
AUTHOR ADDR	Athens, GA 30602	SVM HeaderParse 0.2
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.	SVM HeaderParse 0.2
YEAR	1993	INFERENCE
VENUE	SIAM J. Discrete Math	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	124--138	INFERENCE
VOLUME	6	INFERENCE
CITATIONS	25 found	ParsCit 1.0