Abstract
We present an algorithm which computes the class group of a quadratic order over a principal ideal domain that fulfills some properties which are implicated by computational requirements. It is a generalization of the subexponential method of Hafner and McCurley which computes the class group of an order in an imaginary quadratic number field. We discuss the concept of reduction theory of binary quadratic forms over a Euclidean domain which makes our algorithm practical. Several examples of principal ideal domains are given for which we have applied our generic algorithm implemented in C++ using template techniques.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
L. M. Adleman, J. DeMarrais, 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: Lecture Notes in Computer Science 877: Proceedings of ANTS-I, pp. 28–40. Berlin, Heidelberg: Springer Verlag 1994.
E. Artin: Quadratische Körper im Gebiete der höheren Kongruenzen I. Mathematische Zeitschrift 19 (1924), pp. 153–206. In: S. Lang, J. Tate (eds.): The collected papers of Emil Artin. Reading, Mass.: Addison-Wesley 1965.
J. Buchmann, S. Paulus: Algorithms for finite abelian groups. Extended Abstract. To be published in the proceedings of NTAMCS 93.
D. G. Cantor: Computing in the Jacobian of a hyperelliptic curve. Mathematics of Computation 48 (1987), pp. 95–101.
H. Cohen: Algorithms for modules over Dedekind domains and relative extensions of number fields. Preprint.
R. Flassenberg, S. Paulus: Computing the rational subgroup of the Jacobian of a hyperelliptic curve over a finite field using sieving techniques. In preparation.
C. F. Gauß: Disquisitiones Arithmeticae. Leipzig: Fleischer 1801.
J. L. Hafner, K. S. McCurley: A rigorous subexponential algorithm for the computation of class groups. Journal of the AMS 2 (1989), pp. 837–850.
F. Lemmermeyer: The euclidean algorithm in algebraic number fields. Expositiones Math. 13 (1995), pp. 385–416.
T. Papanikolaou et al.: LiDIA-Manual. Anonymous ftp: crypt1.cs.uni-sb.de
S. Paulus: Algorithmen für endliche abelsche Gruppen. Diplomarbeit. Universität des Saarlandes: 1992.
S. Paulus: Ein Algorithmus zur Berechnung der Klassengruppe quadratischer Ordnungen über Hauptidealringen. Dissertation. Universität Essen: 1995.
M. Seysen: A Probabilistic Factorization Algorithm with Quadratic Forms of Negative Discriminant. Mathematics of Computation 48 (1987), pp. 757–780.
D. Shanks: Class Number, A Theory of Factorization and Genera. Proceedings of Symposia in Pure Mathematics 20 (1970), pp. 415–440.
D. B. Zagier: Zetafunktionen und quadratische Körper. Berlin; Heidelberg; New York: Springer 1981.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Paulus, S. (1996). An algorithm of subexponential type computing the class group of quadratic orders over principal ideal domains. In: Cohen, H. (eds) Algorithmic Number Theory. ANTS 1996. Lecture Notes in Computer Science, vol 1122. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61581-4_60
Download citation
DOI: https://doi.org/10.1007/3-540-61581-4_60
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61581-1
Online ISBN: 978-3-540-70632-8
eBook Packages: Springer Book Archive