Abstract
Numerous cryptosystems have been designed to be secure under the assumption that the computation of discrete logarithms is infeasible. This paper reports on an aggressive attempt to discover the size of fields of characteristic two for which the computation of discrete logarithms is feasible. We discover several things that were previously overlooked in the implementation of Coppersmith’s algorithm, some positive, and some negative. As a result of this work we have shown that field as large as GF(2503) can definitely be attacked.
This research was supported in part by the U.S. Department of Energy under contract number DE-AC04-76DP00789
This work was begun while visiting Sandia National Laboratories
Chapter PDF
References
I. F. Blake, R. Fuji-Hara, R. C. Mullin, and S. A. Vanstone. Computing logarithms in fields of characteristic two. SIAM Journal of Algebraic and Discrete Methods, 5:276–285, 1984.
D. Coppersmith. Fast evaluation of discrete logarithms in fields of characteristic two. IEEE Transactions on Information Theory, 30:587–594, 1984.
D. Coppersmith and J. H. Davenport. An application of factoring. Journal of Symbolic Computation, 1:241–243, 1985.
W. Diffie and M. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, 22:472–492, 1976.
David S. Greenberg and Kevin S. McCurley. Bringing theory to practice: The reality of interprocessor communication. unpublished manuscript, 1993.
B. Hendrickson, Robert Leland, and Steve Plimpton. An efficient parallel algorithm for matrix-vector multiplication. Technical Report SAND92-2765, Sandia National Laboratories, 1992.
B. A. LaMacchia and A. M. Odlyzko. Solving large sparse linear systems over finite fields. In Advances in Cryptology — Proceedings of Crypto’ 90, volume 537 of Lecture Notes in Computer Science, pages 109–133, New York, 1991. Springer-Verlag.
A. K. Lenstra and Mark Manasse. Factoring with two large primes. In Advances in Cryptology — Proceedings of Eurocrypt’ 90, volume 473 of Lecture Notes in Computer Science, pages 72–82, New York, 1991. Springer-Verlag.
Kevin S. McCurley. The Discrete Logarithm Problem, volume 42 of Proceedings of Symposia in Applied Mathematics, pages 49–74. American Mathematical Society, Providence, 1990.
A. Nijenhuis and H.S. Wilf. Combinatorial Algorithms. Academic Press, New York, second edition, 1978.
A. M. Odlyzko. Discrete logarithms in finite fields and their cryptographic significance. In Advances in Cryptology (Proceedings of Eurocrypt 84), number 209 in Lecture Notes in Computer Science, pages 224–314, Berlin, 1985. Springer-Verlag.
A.T. Ogielski and W. Aiello. Sparse matrix computations on parallel processor arrays. SIAM Journal of Scientific and Statistical Computing, 14:??-??, 1993.
Paul C. van Oorschot. A comparison of practical public-key cryptosystems based on integer factorization and discrete logarithms. In Gustavus J. Simmons, editor, Contemporary Cryptology: The Science of Information Integrity, chapter 5, pages 289–322. IEEE Press, Piscataway, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gordon, D.M., McCurley, K.S. (1993). Massively Parallel Computation of Discrete Logarithms. In: Brickell, E.F. (eds) Advances in Cryptology — CRYPTO’ 92. CRYPTO 1992. Lecture Notes in Computer Science, vol 740. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48071-4_22
Download citation
DOI: https://doi.org/10.1007/3-540-48071-4_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57340-1
Online ISBN: 978-3-540-48071-6
eBook Packages: Springer Book Archive