Discrete logarithms: The effectiveness of the index calculus method

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

Volumn 1122, Issue , 1996, Pages 337-362

  Schirokauer, Oliver ^a   Weber, Damian ^b   Denny, Thomas ^b  

^a OBERLIN COLLEGE   (United States)

^b SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE ELEMENT METHOD; NUMBER THEORY; SIEVES;

CRYPTOGRAPHIC SCHEMES; DISCRETE LOGARITHM PROBLEMS; DISCRETE LOGARITHMS; FINITE FIELDS; FUNCTION FIELDS; INDEX CALCULUS; INTRACTIBILITY; NUMBER FIELD SIEVE;

CALCULATIONS;

EID: 84958036387     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61581-4_66     Document Type: Conference Paper

References (72)

1. L. M. Adleman, A subexponential algorithm for the discrete logarithm problem with applications to cryptography, Proc. 20th IEEE Found. Comp. Sci. Syrup., pp. 55-60, 1979
2. L. M. Adleman, The function field sieve, Algorithmic number theory, Lecture Notes in Computer Science 877, Springer-Verlag, pp. 108-121, 1994
3. L. M. Adleman, J. De Marrais, A subexponential algorithm for discrete logarithms over all finite fields, Math. Comp. 61, pp. 1-155, 1993
4. L.M. Adleman, J. De Marrais, M.-D. Huang, A subexponential algorithm for discrete logarithms of large genus hyperelliptic curves over finite fields, Algorithmic number theory, Lecture Notes in Computer Science 877, Springer-Verlag, pp. 28-40, 1994
5. E. Bach, Explicit bounds for primality testing and related problems, Math. Comp. 55, pp. 355-380, 1990
6. R. Balasubramanian, N. Koblitz, The improbability that an elliptic curve has subexponential discrete logarithm problem under the Menezes-Okamoto-Vanstone Algorithm, in preparation
7. I. Biehl, J. Buchmann, Th. Papanikolaou LiDIA - A library for computational number theory, Universität des Saarlandes, preprint, 1995
8. B. den Boer, Diffie-Hellman is as strong as discrete log for certain primes, Advances in Cryptology - Crypto '88, Lecture Notes in Computer Science 403, Springer-Verlag, pp. 530-539, 1989
9. D. Boneh, R. Lipton, Algorithms for black box fields and their application to cryptography, to appear in the proceedings of Crypto '96
10. R. P. Brent, An improved Monte Carlo factorization algorithm, Nordisk Tidskrift för Informationsbehandling (BIT) 20, pp. 176-184, 1980
11. J. Buchmann, M. Jacobson, E. Teske, On some computational problems in finite abelian groups, to appear
12. J. Buchmann, St. Düllmann, On the computation of discrete logarithms in class groups, Advances in Cryptology - Crypto '90, Lecture Notes in Computer Science 537, Springer-Verlag, pp. 134-139, 1991
13. J. Buchmann, Number theoretic algorithms and eryptology, Proceedings FCT '91, Lecture Notes in Computer Science 529, Springer-Verlag, pp. 16-21, 1991
14. J. Buchmann, J. Loho, J. Zayer, An implementation of the general number field sieve, Advances in Cryptology - Crypto '93, Lecture Notes in Computer Science 773, Springer-Verlag, pp. 159-165, 1993
15. J. P. Buhler, H. W. Lenstra Jr., C. Pomerance, Factoring integers with the number field sieve, The development of the number field sieve, Lecture Notes in Mathematics 1554, Springer-Verlag, pp. 50-94, 1993
16. q [X], Acta Arith. 48, pp. 145-165, 1987
17. D. Chaum, E. van Heijst, B. Pfitzmann, Cryptographieally strong undeniable signatures, unconditionally secure for the signer, Advances in Cryptology - Crypto '91, Lecture Notes in Computer Science 576, Springer-Verlag, pp. 212-216, 1992
18. H. Cohen, A course in computational algebraic number theory, Graduate Texts in Mathematics 138, Springer-Verlag, 1993
19. D. Coppersmith, Fast evaluation of discrete logarithms in fields of characteristic two, IEEE Trans. Information Theory IT-30, pp. 587-594, 1984
20. D. Coppersmith, A. Odlyzko, R. Schroeppel, Discrete logarithms in GF(p), Algorithmica 1, pp. 1-15, 1986
21. Th Denny, A Lanczos implementation for GF(p), Universität des Saarlandes, to appear
22. Th Denny, V. Müller, On the reduction of composed relations from the number field sieve, ANTS II, 1996
23. W. Diffie, M. Hellman, New directions in cryptography. IEEE Trans. Information Theory 22, pp. 472-492, 1976
24. B. Dodson, A. K. Lenstra, NFS with four large primes: an explosive experiment, Advances in Cryptology - Crypto '95, Lecture Notes in Computer Science 963, Springer-Verlag, pp. 372-385, 1995
25. St Düllmann, Ein Algorithmus zur Bestimmung der Klassengruppe positiv definiter quadratischer Formen, PhD thesis, Saarbriicken, 1991
26. T. El Gamal, A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Trans. Information Theory 31, pp. 469-472, 1985
27. 2), IEEE Trans. Information Theory 31, pp. 473-481, 1985
28. G. H. Golub, C. F. Van Loan, Matrix computations, The Johns Hopkins University Press, 1993
29. D. Gordon, K. McCurley, Massively parallel computation of discrete logarithms, Advances in Cryptology - Crypto '92, Lecture Notes in Computer Science 740, Springer-Verlag, pp. 312-323, 1993
30. D. Gordon, Discrete logarithms in GF(p) usin# the number field sieve, SIAM J. Discrete Math. 6, pp. 124-138., 1993
31. J. Hafner, K. McCurley, A rigorous subezponential algorithm for computation of class groups, J. Am. Math. Soc. 2, pp. 837-850, 1989
32. N. Koblitz, Elliptic curve cryptosystems, Math. Comp. 48, pp. 203-209, 1987
33. M. Kraltchik, Théorie des hombres, Vol. 1, Gauthier-Villars, 1922
34. M. Kraitchik, Recherehes sur la théorie des hombres, Gauthier-Villars, 1924
35. M. LaMacchia, A. Odlyzko, Solving large sparse linear systems over finite fields, Advances in Cryptology - Crypto '90, Lecture Notes in Computer Science 537, Springer-Verlag, pp. 109-133, 1991.
36. M. LaMwcchia, A. Odlyzko, Computation of discrete logarithms in prime fields, Designs, Codes and Cryptography 1, pp. 46-62, 1991
37. A.K. Lenstra, H. W. Lenstra Jr. (eds.), The development of the number field sieve, Lecture Notes in Mathematics 1554, Springer-Verlag, 1993
38. A. K. Lenstra, H. W. Lenstra Jr., Algorithms in number theory, Technical Report 87-008, University of Chicago, 1987
39. H. W. Lenstra Jr., C. Pomerance A rigorous time bound for factoring integers, J. Amer. Math Soc. 5, pp. 483-516, 1992
40. R. Lovorn, Rigorous, subezponential algorithms for discrete logarithms over finite fields, PhD thesis, University of Georgia, 1992.
41. 2), SIAM J. Discrete Math., to appear
42. R. Lovorn Bender, C. Pomerance Rigorous discrete logarithm computations in finite fields via smooth polynomials, preprint, 1995
43. E. Manstavičius, Semigroup elements free of large prime factors, Analytic and probabilistic methods in number theory, Proceedings of the international conference on analytic and probabilistic methods in number theory in honor of Professor Jonas Kubilius, VSP, Utrecht, pp. 135-153, 1992
44. E. Manstavičius, Remarks on elements of semigroups that are free of large prime factors, Lithuanian Math. J. 32, pp. 400-409, 1993
45. U. Maurer, Towards the equivalence of breaking the Diffie-Hellman protocol and computing discrete logarithms, Advances in Cryptology - Crypto '94, Lecture Notes in Computer Science 839, Springer-Verlag, pp. 271-281, 1994
46. U. Maurer, St Wolf, Diffie-Hellman-oracles, to appear in the proceedings of Crypto '96
47. K. McCurley, The discrete logarithm problem, Cryptology and computational number theory, Proc. Syrup. in Applied Mathematics 42, American Mathematical Society, pp. 49-74, 1990
48. A. Menezes, Elliptic curve public key cryptosystems, Kluwer, 1993
49. A. Menezes, T. Okamoto, S. Vanstone, Reducing elliptic curve logarithms to logarithms in a finite field, Proceedings of the 23rd Annual ACM Symposium on the Theory of Computing, pp. 80-89, 1991
50. A. Menezes, S. Vanstone, Elliptic curve cryptosystems and their implementation, J. Cryptology 6, pp. 209-224, 1994
51. V. Miller, Use of elliptic curves in cryptography, Advances in Cryptology - Crypto '85, Lecture Notes in Computer Science 218, Springer-Verlag, pp. 417-426, 1986
52. V. Müller, A. Stein, Ch. Thiel, Computing discrete logarithms in real quadratic congruence function fields of large genus, preprint, 1996
53. National Bureau of Standards, Digital signature standard, FIPS Publication 186, 1994
54. R. Needham, M. Schroeder, Using encryption for authentication in large networks of computers, Comm. ACM 21, pp. 993-999, 1978
55. A. Odlyzko, Discrete logarithms in finite fields and their cryptographic significance, Advances in Cryptology - Eurocrypt '84 Lecture Notes in Computer Science 209, Springer-Verlag, pp. 224-314, 1985
56. A. Odlyzko, Discrete logarithms and smooth polynomials, Finite fields: theory, applications, and algorithms (Las Vegas, NV, 1993), Contemp. Math 168, Amer. Math. Soc., pp. 269-278, 1994
57. S. Pohlig, M. Hellman, An improved algorithm for computing logarithms over GF(p) and its cryptographic significance, IEEE Trans. on Information Theory 24, pp. 106-110, 1978
58. J. M. Pollard, Monte Carlo methods for index computation (mod p), Math. Comp. 32, pp. 918-924, 1978
59. C. Pomerance, Fast rigorous factorization and discrete logarithms algorithms, Discrete algorithms and complexity (D.S. Johnson, T. Nishizeki, A. Nozaki and H. Wilf, eds.), Academic Press, pp. rp, 1987
60. R. Rivest, A. Shamir, L. Adleman, A method for obtaining digital signatures and public key cryptosystems, Communication of the ACM 21, pp. 120-126, 1978
61. O. Schirokauer, Discrete logarithms and local units, Phil. Trans. R. Soc. Lond. A 345, pp. 409-423, 1993
62. O. Schirokauer, Using number fields to compute logarithms in finite fields, to appear
63. C. Schnorr, Efficient signature generation by smart cards, Journal of Cryptology 4, pp. 161-174, 1991
64. R. Schoof, Quadratic fields and factorization, Computational Methods in Number Theory, Mathematisch Centrum Trakt 154, Amsterdam, pp. 235-286, 1982
65. I. A. Semaev, An algorithm for evaluation of discrete logarithms in some nonprime finite fields, Math. Comp., to appear
66. Th. Setz, R. Roth, LIPS: a system for distributed processing on workstations, SFB 124 TP D5, Universität des Saarlandes, 1992
67. K. Soundararajan, Smooth polynomials: analogies and asymptotics, J. London Math. Soc., to appear
68. D. R. Stinson, Cryptography in theory and practice, CRC Press, 1995
69. B. Taylor, D. Goldberg, Secure networking in the Sun environment, Proc. USENIX Assoc. Summer Conference, Atlanta, pp. 28-37, 1986
70. D. Weber, An implementation of the number field sieve to compute discrete logarithms mod p, Advances in Cryptology - Eurocrypt'95, Lecture Notes in Computer Science 921, Springer-Verlag, pp. 95-105, 1995
71. D. Weber, Computing discrete logarithms with the number field sieve, ANTS II, 1996
72. J. Zayer, Faktorisieren mit dem Number Field Sieve, PhD thesis, Saarbriicken, 1995