Fast quantum algorithms for computing the unit group and class group of a number field

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2005, Pages 468-474

  Hallgren, Sean ^a  

^a NEC LABORATORIES AMERICA   (United States)

Author keywords

Class Group; Computational Algebraic Number Theory; Quantum Algorithms; Unit Group

Indexed keywords

CLASS GROUP; COMPUTATIONAL ALGEBRAIC NUMBER THEORY; QUANTUM ALGORITHMS; UNIT GROUP;

ALGEBRA; COMPUTATION THEORY; NUMBER THEORY; POLYNOMIALS; QUANTUM THEORY;

ALGORITHMS;

EID: 33748108010     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1060590.1060660     Document Type: Conference Paper

References (13)

1. J. Buchmann and M. Pohst. Computing a lattice basis from a system of generating vectors. In Eurocal'87. volume 378 of LNCS, pages 54-63. Springer-Verlag, June 1987.
2. J. Buchmann and H. C. Williams. On the existence of a short proof for the value of the class number and regulator of a real quadratic field. In Number theory and applications (Banff, AB, 1988), pages 327-345. Kluwer Acad. Publ., Dordrecht, 1989.
3. H. Cohen. A course in computational algebraic number theory, volume 138 of Graduate Texts in Mathematics. Springer-Verlag, 1993.
4. L. Hales and S. Hallgren. Quantum fourier sampling simplified. In Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, pages 330-338, Atlanta, Georgia, 1-4 May 1999.
5. S. Hallgren. Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem. In Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing, pages 653-658, Montreal, Quebec, Canada, 19-21 May 2002.
6. H. W. Lenstra, Jr. Algorithms in algebraic number theory. Bulliten of the American Mathematical Society, 26(2)-.221-244, Apr. 1992.
7. D. Micciancio and S. Goldwasser. Complexity of Lattice Problems: a cryptographic perspective, volume 671 of The Kluwer International Series in Engineering and Computer Science. Kluwer Academic Publishers, Boston. Massachusetts. Mar. 2002.
8. A. Schmidt and U. Vollmer. Polynomial time quantum algorithm for the computation of the unit group of a number field. In Proceedings of the 37th ACM Symposium on Theory of Computing, May 2005. In these proceedings.
9. R. Schoof. Computing Arakelov class groups. To appear, 2004.
10. P. W. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput., 26(5):1484-1509, Oct. 1997.
11. D. R. Simon. On the power of quantum computation. SIAM J. Comput., 26(5):1474-1483, Oct. 1997.
12. C. Thiel. Under the assumption of the generalized riemann hypothesis verifying the class number belongs to NP ∩ co-NP. In L. M. Adleman and M.-D. Huang, editors, Algorithmic number theory, ANTS-I, volume 877 of Lecture Notes in Computer Science, pages 234-247. Springer-Verlag, 1994.
13. C. Thiel. On the complexity of some problems in algorithmic algebraic number theory. PhD thesis, Universität des Saarlandes. Saarbrücken. Germany, 1995.