Abstract
This article presents algorithms for computing discrete logarithms in class groups of quadratic number fields. In the case of imaginary quadratic fields, the algorithm is based on methods applied by Hafner and McCurley [HM89] to determine the structure of the class group of imaginary quadratic fields. In the case of real quadratic fields, the algorithm of Buchmann [Buc89] for computation of class group and regulator forms the basis. We employ the rigorous elliptic curve factorization algorithm of Pomerance [Pom87], and an algorithm for solving systems of linear Diophantine equations proposed and analysed by Mulders and Storjohann [MS99]. Under the assumption of the Generalized Riemann Hypothesis, we obtain for fields with discriminant d a rigorously proven time bound of \(L_{|d|} [\frac{1}{2}, \frac{3}{4}\sqrt{2}]\).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abel, C.S.: Ein Algorithmus zur Berechnung der Klassenzahl und des Regulators reellquadratischer Ordnungen. PhD thesis, Universität des Saarlandes, Saarbrücken, Germany (1994)
Bach, E.: Explicit bounds for primality testing and related problems. Math. Comp. 55, 355–380 (1990)
Buchmann, J., Düllmann, S.: On the computation of discrete logarithms in class groups. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 134–139. Springer, Heidelberg (1991)
Buchmann, J., Kessler, V.: Computing a reduced lattice basis from a generating system (1992) (unpublished manuscript)
Buchmann, J.: A subexponential algorithm for the determination of class groups and regulators of algebraic number fields. Séminaire de Théoriedes Nombres, Paris, 27–41 (1988-1989)
Buchmann, J., Williams, H.C.: A key-exchange system based on imaginaryquadratic fields. Journal of Cryptology 1, 107–118 (1988)
Cohen, H.: A course in computational algebraic number theory. Springer, Heidelberg (1993)
Giesbrecht, M., Lobo, A., Saunders, B.D.: Certifying inconsistency of sparse linear systems. In: Gloor, O. (ed.) Proc. Int’l. Symp. on Symbolic and Algebraic Computation: ISSAC 1998, pp. 113–119 (1998)
Hafner, J.L., McCurley, K.S.: A rigorous subexpoential algorithm for computation of class groups. J. Amer. Math. Soc. 2, 839–850 (1989)
Lenstra Jr., H.W., Pomerance, C.: A rigorous time bound for factoring integers. J. Amer. Math. Soc. 5, 483–516 (1992)
Maurer, M.: Regulator approximation and fundamental unit computation for real quadratic orders. PhD thesis, TU Darmstadt (2000)
McCurley, K.: Cryptographic key distribution and computation in class groups. In: Mollin, R.A. (ed.) Number Theory and Applications, pp. 459–479. Kluwer Academic Publishers, Dordrecht (1989)
Mulders, T., Storjohann, A.: Diophantine linear system solving. In: Proc. 1999 Int’l. Symp. on Symbolic and Algebraic Computation: ISSAC (1999) (to appear)
Pomerance, C.: 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, London (1987)
Seysen, M.: A probablistic factorization algorithm with quadratic forms of negative discriminant. Math. Comp. 48, 757–780 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vollmer, U. (2000). Asymptotically Fast Discrete Logarithms in Quadratic Number Fields. In: Bosma, W. (eds) Algorithmic Number Theory. ANTS 2000. Lecture Notes in Computer Science, vol 1838. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10722028_39
Download citation
DOI: https://doi.org/10.1007/10722028_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67695-9
Online ISBN: 978-3-540-44994-2
eBook Packages: Springer Book Archive