An implementation of the general number field sieve to compute discrete logarithms mod p

Authors:
Damian Weber
Affiliations:
FB Informatik, Universität des Saarlandes, Saarbrücken, Germany
Venue:
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Year:
1995

Citing 4
Cited 0

Discrete logarithms in GF(p)

Algorithmica
The number field sieve

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
The digital signature standard

Communications of the ACM
An implementation of the general number field sieve

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology

Quantified Score

Hi-index	0.00

Visualization

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 experience 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.