A general framework for subexponential discrete logarithm algorithms

Acta Arithmetica

Volumn 102, Issue 1, 2002, Pages 83-103

  Enge, Andreas ^a   Gaudry, Pierrick ^b  

^a ÉCOLE POLYTECHNIQUE   (France)

^b UNIVERSITY OF AUGSBURG   (Germany)

Author keywords

Class group; Discrete logarithm; Index calculus; Subexponentiality

Indexed keywords

EID: 0042833029     PISSN: 00651036     EISSN: None     Source Type: Journal    
DOI: 10.4064/aa102-1-6     Document Type: Article

References (37)

1. L. M. Adleman and J. DeMarrais, A subexponential algorithm for discrete logarithms over all finite fields, Math. Comp. 61 (1993), 1-15.
2. L. M. Adleman, J. DeMarrais and M.-D. Huang, A subexponential algorithm for discrete logarithms over the rational subgroup of the Jacobians of large genus hyperelliptic curves over finite fields, in: L. M. Adleman and M.-D. Huang (eds.), Algorithmic Number Theory, Lecture Notes in Comput. Sci. 877, Springer, Berlin, 1994, 28-40.
3. E. Artin, Quadratische Körper im Gebiete der höheren Kongruenzen II, Math. Z. 19 (1924), 207-246.
4. R. L. Bender and C. Pomerance, Rigorous discrete logarithm computations in finite fields via smooth polynomials, in: D. A. Buell and J. T. Teitelbaum (eds.), Computational Perspectives on Number Theory: Proceedings of a Conference in Honor of A. O. L. Atkin, Stud. Adv. Math. 7, Amer. Math. Soc., 1998, 221-232.
5. J. Buchmann, A subexponential algorithm for the determination of class groups and regulators of algebraic number fields, in: C. Goldstein (ed.), Séminaire de Théorie des Nombres, Paris 1988-1989, Progr. in Math. 91, Birkhäuser, Boston, 1990, 27-41.
6. J. Buchmann and H. C. Williams, A key-exchange system based on imaginary quadratic fields, J. Cryptology 1 (1988), 107-118.
7. H. Cohen, A Course in Computational Algebraic Number Theory, Grad. Texts in Math. 138, Springer, New York, 1993.
8. W. Dime and M. E. Hellman, New directions in cryptography, IEEE Trans. Inform. Theory 22 (1976), 644-655.
9. S. Düllmann, Ein Algorithmus zur Bestimmung der Klassengruppe positiv definiter binärer quadratischer Formen, PhD thesis, Universität des Saarlandes, Saarbrücken, 1991.
10. W. Eberly and E. Kaltofen, On randomized Lanczos algorithms, in: W. W. Küchlin (ed.), ISSAC 97 - Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, ACM Press, 1997, 176-183.
11. T. ElGamal, A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Trans. Inform. Theory 31 (1985), 469-472.
12. A. Enge, Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time, Math. Comp., to appear.
13. A. Enge and A. Stein, Smooth ideals in hyperelliptic function fields, ibid., to appear.
14. J. von zur Gathen and J. Gerhard, Modern Computer Algebra, Cambridge Univ. Press, 1999.
15. P. Gaudry, An algorithm for solving the discrete log problem on hyperelliptic curves, in: B. Preneel (ed.), Advances in Cryptology - EUROCRYPT 2000, Lecture Notes in Comput. Sci. 1807, Springer, Berlin, 2000, 19-34.
16. J. L. Hafner and K. S. MCCurley, A rigorous subexponential algorithm for computation of class groups, J. Amer. Math. Soc. 2 (1989), 837-850.
17. E. Kaltofen and B. D. Saunders, On Wiedemann's method of solving sparse linear systems, in: H. F. Mattson, T. Mora and T. R. N. Rao (eds.), Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Lecture Notes in Comput. Sci. 539, Springer, Berlin, 1991, 29-38.
18. J. Knopfmacher, Abstract Analytic Number Theory, North-Holland Math. Library 12, North-Holland, Amsterdam, 1975.
19. N. Koblitz, Elliptic curve cryptosystems, Math. Comp. 48 (1987), 203-209.
20. _, Hyperelliptic cryptosystems, J. Cryptology 1 (1989), 139-150.
21. B. A. LaMacchia and A. M. Odlyzko, Solving large sparse linear systems over finite fields, in: A. J. Menezes and S. A. Vanstone (eds.), Advances in Cryptology-CRYPTO '90, Lecture Notes in Comput. Sci. 537, Springer, Berlin, 1991, 109-133.
22. H. W. Lenstra, Jr., J. Pila and C. Pomerance, A hyperelliptic smoothness test, I, Philos. Trans. Roy. Soc. London Ser. A 345 (1993), 397-408.
23. H. W. Lenstra, Jr. and C. Pomerance, A rigorous time bound for factoring integers, J. Amer. Math. Soc. 5 (1992), 483-516.
24. K. S. MCCurley, Cryptographic key distribution and computation in class groups, in: R. A. Mollin (ed.), Number Theory and Applications, NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci. 265, Kluwer, Dordrecht, 1989, 459-479.
25. V. S. Miller, Use of elliptic curves in cryptography, in: H. C. Williams (ed.), Advances in Cryptology - CRYPTO '85, Lecture Notes in Comput. Sci. 218, Springer, Berlin, 1986, 417-426.
26. V. Müller, A. Stein and C. Thiel, Computing discrete logarithms in real quadratic congruence function fields of large genus, Math. Comp. 68 (1999), 807-822.
27. V. Müller, S. Vanstone and R. Zuccherato, Discrete logarithm based cryptosystems in quadratic function fields of characteristic 2, Des. Codes Cryptogr. 14 (1998), 159-178.
28. A. Odlyzko, Discrete logarithms: The past and the future, ibid. 19 (2000), 129-145.
29. S. Paulus and H.-G. Rück, Real and imaginary quadratic representations of hyperelliptic function fields, Math. Comp. 68 (1999), 1233-1241.
30. J. M. Pollard, Theorems on factorization and primality testing, Proc. Cambridge Philos. Soc. 76 (1974), 521-528.
31. C. Pomerance, Fast, rigorous factorization and discrete logarithm algorithms, in: D. S. Johnson et al. (eds.), Discrete Algorithms and Complexity (Kyoto, 1986), Perspectives in Computing 15, Academic Press, Orlando, 1987, 119-143.
32. J. B. Rosser and L. Schoenfeld, Approximate formulas for some functions of prime numbers, Illinois J. Math. 6 (1962), 64-94.
33. R. Scheidler, A. Stein and H. C. Williams, Key-exchange in real quadratic congruence function fields, Des. Codes Cryptogr. 7 (1996), 153-174.
34. I. A. Semaev, Computation of discrete logarithms in an arbitrary finite field, Discrete Math. Appl. 5 (1995), 107-116.
35. M. Seysen, A probabilistic factorization algorithm with quadratic forms of negative discriminant, Math. Comp. 48 (1987), 757-780.
36. C. L. Siegel, Über die Classenzahl quadratischer Zahlkörper, Acta Arith. 1 (1936), 83-86.
37. V. Strassen, Einige Resultate über Berechnungskomplexität, Jahresber. Deutsch. Math.-Verein. 78 (1976), 1-8.