Asymptotically fast discrete logarithms in quadratic number fields

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

Volumn 1838, Issue , 2000, Pages 581-594

  Vollmer, Ulrich ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); NUMBER THEORY;

ALGORITHM FOR SOLVING; DISCRETE LOGARITHMS; ELLIPTIC CURVE; FACTORIZATION ALGORITHMS; LINEAR DIOPHANTINE EQUATIONS; QUADRATIC FIELDS; QUADRATIC NUMBER; RIEMANN HYPOTHESIS;

COMPUTATION THEORY;

EID: 84946819289     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10722028_39     Document Type: Conference Paper

References (15)

1. C.S. Abel. Ein Algorithmus zur Berechnung der Klassenzahl und des Regulators reellquadratischer Ordnungen. PhD thesis, Universität des Saarlandes, Saarbrücken, Germany, 1994.
2. E. Bach. Explicit bounds for primality testing and related problems. Math. Comp., 55: 355-380, 1990.
3. J. Buchmann and S. Düllmann. On the computation of discrete logarithms in class groups. In Proc. of CRYPTO '90, volume 537 of Lecture Notes in Computer Science, pages 134-139, Springer, 1990.
4. J. Buchmann and V. Kessler. Computing a reduced lattice basis from a generating system. Unpublished manuscript, 1992.
5. J. Buchmann. A subexponential algorithm for the determination of class groups and regulators of algebraic number fields. In Séminaire de Théorie des Nombres, pages 27-41, Paris, 1988-89.
6. J. Buchmann and H.C. Williams. A key-exchange system based on imaginary quadratic fields. Journal of Cryptology, 1: 107-118, 1988.
7. H. Cohen. A course in computational algebraic number theory. Springer, Heidelberg, 1993.
8. M. Giesbrecht, A. Lobo, and B.D. Saunders. Certifying inconsistency of sparse linear systems. In O. Gloor, editor, Proc. Lnt’l. Symp. on Symbolic and Algebraic Computation: LSSAC '98, pages 113-119, 1998.
9. J. L. Hafner and K. S. McCurley. A rigorous subexpoential algorithm for computation of class groups. J. Amer. Math. Soc., 2: 839-850, 1989.
10. H.W. Lenstra Jr. and C. Pomerance. A rigorous time bound for factoring integers. J. Amer. Math. Soc., 5: 483-516, 1992.
11. M. Maurer. Regulator approximation and fundamental unit computation for real quadratic orders. PhD thesis, TU Darmstadt, 2000.
12. K. McCurley. Cryptographic key distribution and computation in class groups. In R.A. Mollin, editor, Number Theory and Applications, pages 459-479, Kluwer Academic Publishers, 1989.
13. Th. Mulders and A. Storjohann. Diophantine linear system solving. In Proc. Lnt’l. Symp. on Symbolic and Algebraic Computation: LSSAC '99, 1999. to appear.
14. C. Pomerance. Fast, rigorous factorization and discrete logarithm algorithms. In Discrete Logarithms and complexity, Proc. of the Japan-US joint seminar on discrete logarithms and complexity theory. Academic Press, 1987.
15. M. Seysen. A probablistic factorization algorithm with quadratic forms of negative discriminant. Math. Comp., 48: 757-780, 1987.