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.
Chapter PDF
References
D. Bernstein, A. K. Lenstra, A general Number Field Sieve Implementation, in [11], 1991
J. Buchmann, J. Loho, J. Zayer, An implementation of the general number field sieve, Advances in Cryptology Crypto (1993) Lecture Notes in Computer Science 773, pp. 159–165
J. P. Buhler, H. W. Lenstra, C. Pomerance, Factoring integers with the number field sieve, in [11], 1992
D. Coppersmith, A. Odlyzko, R. Schroeppel, Discrete Logarithms in GF(p), Algorithmica 1, 1986, pp. 1–15
K. Mc Curley, The Discrete Logarithm Problem, Cryptology and Computational Number Theory, Proc. Symp. in Applied Mathematics, American Mathematical Society, 1990
Th. Denny, A Structured Gauss Implementation for GF(p), Universität des Saarlandes, to appear
R. Dentzer, libI: eine lange ganzzahlige Arithmetik, IWR Heidelberg, 1991
W. Diffie, M. Hellman, New directions in Cryptography. IEEE Trans. Inform. Theory 22 (1976), pp. 472–492
T. ElGamal, A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inform. Theory 31 (1985), pp. 469–472
D. Gordon, Discrete Logarithms in GF(p) using the Number Field Sieve, University of Georgia, preprint 1992
A. K. Lenstra, H. W. Lenstra, The development of the number field sieve, Springer-Verlag, 1993
A. K. Lenstra, H. W. Lenstra, M. S. Manasse, J. M. Pollard, The number field sieve. Abstract: Proc. 22nd Ann. ACM Symp. on Theory of Computing (STOC)(1990), 564–572
A. K. Lenstra, lip: A long integer package, Bellcore, 1989
National Institute of Standards and Technology. The Digital Signature Standard, proposal and discussion, Comm. of the ACM, 35(7), pp. 36–54, 1992
I. Biehl, J. Buchmann, Th. Papanikolaou LiDIA — A library for computational number theory, Universität des Saarlandes, submitted to ISAAC 1995
J. M. Pollard, Monte Carlo Methods for Index Computation (mod p), Math. Comp. 32, 918–924, 1978
S. Pohlig, M. Hellman, An improved algorithm for computing logarithms over GF(p) and its cryptographic significance, IEEE Trans. on Inform. Theory 24, 106–110, 1978
O. Schirokauer, Discrete Logarithms and Local Units, Phil. Trans. R. Soc. Lond. A (1993) 345, 409–423
D. Shanks, Class Number, a Theory of Factorization and Genera, Proc. Symposium Pure Mathematics Vol. 20, American Mathematical Society, Providence, R. I., 1970, pp. 415–440
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Weber, D. (1995). An Implementation of the General Number Field Sieve to Compute Discrete Logarithms mod p . In: Guillou, L.C., Quisquater, JJ. (eds) Advances in Cryptology — EUROCRYPT ’95. EUROCRYPT 1995. Lecture Notes in Computer Science, vol 921. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49264-X_8
Download citation
DOI: https://doi.org/10.1007/3-540-49264-X_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59409-3
Online ISBN: 978-3-540-49264-1
eBook Packages: Springer Book Archive