The solution of McCurley's discrete log challenge

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1462, Issue , 1998, Pages 458-471

  Weber, Damian ^a   Denny, Thomas ^b  

^a FRAUNHOFER INSTITUTE FOR INDUSTRIAL MATHEMATICS ITWM   (Germany)

^b Debis IT Security Services   (Germany)

Author keywords

Discrete logarithms; Index calculus; Lanczos; Number field sieve

Indexed keywords

CALCULATIONS; LINEAR ALGEBRA; SIEVES;

DIFFIE HELLMAN; DISCRETE LOGARITHMS; INDEX CALCULUS; LANCZOS; LANCZOS ALGORITHM; NUMBER FIELD SIEVE;

CRYPTOGRAPHY;

EID: 84957715627     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0055747     Document Type: Conference Paper

References (24)

1. I. Biehl and J. Buchmann and T. Papanikolaou. LiDIA-a library for computational number theory. Technical report, Universität des Saarlandes/Germany
2. T. F. Denny. Lösen grosser dünnbesetzter Gleichungssysteme über endlichen Primkörpem. PhD thesis, Universität des Saarlandes/Germany, 1997.
3. W. Diffie and M. Heilman. New directions in cryptography. IEEE Trans. Information Theory 22, pages pp. 472-492, 1976.
4. T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Information Theory, 31:469-472, 1985.
5. D. Gordon. Discrete logarithms in GF(p) using the number field sieve. SIAM J. Discrete Math., 6:124-138, 1993.
6. D. E. Knuth and L. Trabb Pardo. Analysis of a simple factorization algorithm. Theoretical Computer Science, 3:321-348, 1976.
7. M. LaMacchia and A. Odlyzko. Solving large sparse linear systems over finite fields. In Advances in Cryptology-Crypto '90, number 537 in Lecture Notes in Computer Science, pages 109-133, 1990.
8. M. LaMacchia and A. Odlyzko. Computation of discrete logarithms in prime fields. Designs, Codes and Cryptography, 1:46-62, 1991.
9. A. K. Lenstra, H. W. Lenstra, Jr. (eds). The development of the number field sieve. Number 1554 in Lecture Notes in Mathematics. Springer, 1993.
10. H. W. Lenstra, Jr. Factoring integers with elliptic curves. Ann. of Math., 126: 649-673, 1987.
11. K. S. McCurley. The discrete logarithm problem. In Cryptology and Computational Number Theory, number 42 in Proc. Symp. in Applied Mathematics, pages 49-74. American Mathematical Society, 1990.
12. P. L. Montgomery. Modular multiplication without trial division. Math. Comp., 44:519-521, 1985.
13. V. Müller and T. F. Denny. On the reduction of composed relations from the number field sieve. In H. Cohen, editor, Algorithmic Number Theory-ANTS II, number 1122 in Lecture Notes in Computer Science, 1996.
14. National Bureau of Standards. Digital signature standard, 1994. FIPS Publication 186.
15. J. M. Pollard. The lattice sieve. Number 1554 in Lecture Notes in Mathematics. Springer, 1993.
16. C. Pomerance and S. S. Wagstaff. Implementation of the continued fraction integer factoring algorithm. In Proc. 12th Manitoba Conf, Winnipeg/Manitoba 1982, Congr. Numerantium, volume 37 of Numerical mathematics and computing, pages 99-118, 1983.
17. O. Schirokauer. Discrete logarithms and local units. Phil. Trans. R. Soc. Lond. A 345, pages 409-423, 1993.
18. O. Schirokauer, D. Weber, and T. F. Denny. Discrete logarithms: the effectiveness of the index calculus method. In H. Cohen, editor, Algorithmic Number Theory-ANTS II, number 1122 in Lecture Notes in Computer Science, 1996.
19. D. Shanks. Solved and unsolved problems in number theory (3rd ed). Chelsea Publishing Company, 1985.
20. D. Weber. Computing discrete logarithms with quadratic number rings. In Euro-crypt'98, Lecture Notes in Computer Science, 1998. To appear.
21. D. Weber. Computing discrete logarithms with the number field sieve. In H. Cohen, editor, Algorithmic Number Theory-ANTS II, number 1122 in Lecture Notes in Computer Science, 1996.
22. D. Weber. On the computation of discrete logarithms in finite prime fields. PhD thesis, Universität des Saarlandes/Germany, 1997.
23. D. Weber. An implementation of the number field sieve to compute discrete logarithms mod p. Advances in Cryptology-Eurocrypt'95. number 921 in Lecture Notes in Computer Science, 1995.
24. J. Zayer. Fàktorisieren mit dem Number Field Sieve. PhD thesis, Universität des Saarlandes/Germany, 1995.