A rigorous subexponential algorithm for computation of class groups

Journal of the American Mathematical Society

Volumn 2, Issue 4, 1989, Pages 837-850

  Hafner, James L ^a   McCurley, Kevin S ^a,b  

^a IBM ALMADEN RESEARCH CENTER   (United States)

^b SANDIA NATIONAL LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84968519059     PISSN: 08940347     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0894-0347-1989-1002631-0     Document Type: Article

References (21)

1. D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, preprint, 1987. Extended abstract in Proc. 19th ACM Sympos. on Theory of Comput. ACM, New York, 1987, pp. 1–6.
2. P. D. Domich, R. Kannan, and L. E. Trotter, Hermite normal form computation using modulo determinant arithmetic, Math. Oper. Res. 12 (1987), 50–59.
3. K. F. Gauss, Disquisitiones arithmeticœ, Fleischer, Lepzig, 1801. Translation into English by Arthur A. Clarke, S. J., reprinted by Springer-Verlag, New York, 1985.
4. D. Goldfeld, Gauss’ class number problem for imaginary quadratic fields, Bull. Amer. Math. Soc. 13 (1985), 23–37.
5. T. C. Hu, Integer programming and network flows, Addison-Wesley, Reading, MA, 1969.
6. Hua Loo Keng, Introduction to number theory. Translation into English by Peter Shiu, Springer-Verlag, New York, 1982.
7. Ravindran Kannan and Achim Bachem, Polynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix, SIAM J. Comput. 8 (1979), 499–507.
8. D. E. Knuth, The art of computer programming, Vol. 2: Seminumerical algorithms, 2nd ed., Addison-Wesley, Reading, MA, 1981.
9. A. K. Lenstra and H. W. Lenstra, Jr., Algorithms in number theory, Technical Report 87–008, Dep. of Computer Science, Univ. of Chicago, 1987.
10. H. W. Lenstra, Jr., On the calculation of regulators and class numbers of quadratic fields, Journées Arithmétiques 1980 (J. V. Armitage, ed.), Cambridge Univ. Press, New York, 1982.
11. Kevin S. McCurley, Cryptographic key distribution and computation in class groups, Number Theory and Applications (Proc. NATO Advanced Study Inst, on Number Theory and Applications, Banff, 1988) (Richard A. Molin, ed.), Kluwer, Boston, 1989.
12. W. Narkiewicz, Classical problems in number theory, PWN, Polish Sci. Publ., Warsaw, 1986.
13. Carl Pomerance, Fast, rigorous factorization and discrete logarithm algorithms, Discrete Algorithms and Complexity (Proc. Japan-US Joint Seminar, June 1986, Kyoto, Japan), Academic Press, Orlando, 1987, pp. 119–143.
14. A. Schönhage and V. Strassen, Schnelle Multiplikation grosser Zahlen, Computing 7 (1971), 281–292.
15. A. Schönhage, Schnelle Berechnung von Kettenbruchenentwicklungen, Acta Inform. 1 (1971), 139–144.
16. R. Schoof, Quadratic fields and factorization, Computation Methods in Number Theory (R. Tijdeman and H. W. Lenstra, Jr., eds.), Math. Centrum Tract 154, Amsterdam, 1982, pp. 235–286.
17. A. Schrijver, Theory of linear and integer programming, Wiley, New York, 1985.
18. Martin Seysen, A probabilistic factorization algorithm with quadratic forms of negative discriminant, Math. Comp. 48 (1987), 757–780.
19. Daniel Shanks, Class number, a theory of factorization, and genera, Proc. Sympos. Pure Math., Vol. 20, Amer. Math. Soc., Providence, RI, 1971, pp. 415–440.
20. ——, Five number-theoretic algorithms, Proc. Second Manitoba Conference on Numerical Mathematics, Univ. of Manitoba, Congressus Numerantium, No. VII, Utilitas. Math., Winnipeg, 1973, pp. 51–70.
21. Douglas H. Wiedemann, Solving sparse linear equations over finite fields, IEEE Trans. Inform. Theory 32 (1986), 54–62.