Paper Info
Title
An implementation of the general number field sieve to compute discrete logarithms mod p
Abstract
There are many cryptographic protocols the security of which depends on the difficulty of solving the discrete logarithm problem ([8], [9], [14], etc.). In [10] and [18] it was described how to apply the number field sieve algorithm to the discrete logarithm problem in prime fields. This resulted in the asymptotically fastest known discrete log algorithm for finite fields of p elements. Very little is known about the behaviour of this algorithm in practice. In this report we write about our practical ex- perience with our implementation of their algorithm whose first version was completed in October 1994 at the Department of Computer Science at the Universität des Saarlandes.
Year
DOI
Venue
1995
10.1007/3-540-49264-X_8
EUROCRYPT
Keywords
Field
DocType
discrete log algorithm,practical experience,finite field,number field sieve algorithm,mod p,computer science,prime field,general number field sieve,p element,cryptographic protocol,discrete logarithm problem,discrete logarithm
Discrete mathematics,Combinatorics,Finite field,Special number field sieve,Baby-step giant-step,Iterated logarithm,Logarithm,General number field sieve,Pollard's kangaroo algorithm,Mathematics,Discrete logarithm
Conference
ISBN
Citations 
PageRank 
3-540-59409-4
3
0.80
References 
Authors
7
1
Name
Order
Citations
PageRank
Damian Weber19816.23