Skip to main content
×
×
Home

Subexponential class group and unit group computation in large degree number fields

  • Jean-François Biasse (a1) and Claus Fieker (a2)
Abstract

We describe how to compute the ideal class group and the unit group of an order in a number field in subexponential time. Our method relies on the generalized Riemann hypothesis and other usual heuristics concerning the smoothness of ideals. It applies to arbitrary classes of number fields, including those for which the degree goes to infinity.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      Subexponential class group and unit group computation in large degree number fields
      Available formats
      ×
      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      Subexponential class group and unit group computation in large degree number fields
      Available formats
      ×
      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      Subexponential class group and unit group computation in large degree number fields
      Available formats
      ×
Copyright
References
Hide All
1.Adleman, L. and DeMarrais, J., ‘A subexponential algorithm for discrete logarithms over all finite fields’, Advances in cryptology — CRYPTO ’93, Proceedings of the 13th Annual International Cryptology Conference, Santa Barbara, California, USA, August 22–26, 1993, Lecture Notes in Computer Science 773 (ed. Stinson, D.; Springer, 1993) 147158.
2.Bach, E., ‘Explicit bounds for primality testing and related problems’, Math. Comp. 55 (1990) no. 191, 355380.
3.Bach, E., ‘Improved approximations for Euler products’, Number theory, CMS Conference Proceedings 15 (American Mathematical Society, Providence, RI, 1995) 1328.
4.Biasse, J.-F., ‘An L (1∕3) algorithm for ideal class group and regulator computation in certain number fields’, Math. Comp. 83 (2014) 20052031.
5.Biasse, J.-F., ‘Subexponential time relations in large degree number fields’, Adv. Math. Commun. Preprint.
6.Biasse, J.-F., ‘Subexponential algorithms for number fields’, PhD Thesis, École Polytechnique, Paris, 2011.
7.Biasse, J.-F. and Fieker, C., ‘New techniques for computing the ideal class group and a system of fundamental units in number fields’, Comp. Res. Repository, Preprint, 2012, arXiv:1204.1294.
8.Bisson, G., ‘Endomorphism rings in cryptography’, PhD Thesis, LORIA, Nancy, France, 2011.
9.Buchmann, J., ‘A subexponential algorithm for the determination of class groups and regulators of algebraic number fields’, Séminaire de Théorie des Nombres, Paris 1988–1989, Progress in Mathematics (ed. Goldstein, C.; Birkhäuser, Boston, 1990) 2741.
10.Buchmann, J., Thiel, C. and Williams, H.C., ‘Short representation of quadratic integers’, Computational algebra and number theory, Mathematics and its Applications 325 (Springer, 1995) 159185.
11.Cassels, J., An introduction to the geometry of numbers, Classics in Mathematics (Springer, 1997) ; corrected reprint of the 1971 edition.
12.Cohen, H., Diaz Y Diaz, F. and Olivier, M., ‘Subexponential algorithms for class group and unit computations’, J. Symbolic Comput. 24 (1997) no. 3–4, 433441.
13.Enge, A., Gaudry, P. and Thomé, E., ‘An L (1∕3) discrete logarithm algorithm for low degree curves’, J. Cryptology 24 (2011) no. 1, 2441.
14.Erdős, P. and Turán, P., ‘On some problems of a statistical group-theory. I.’, Z. Wahr. Verw. Geb. 4 (1965) 175186.
15.Gama, N. and Nguyen, P., ‘Finding short lattice vectors within Mordell’s inequality’, Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17–20, 2008 (ed. Dwork, C.; ACM, 2008) 207216.
16.Gordon, D., ‘Discrete logarithms in GF(p) using the number field sieve’, SIAM J. Discrete Math. 6 (1993) 124138.
17.Hafner, J.L. and McCurley, K.S., ‘A rigorous subexponential algorithm for computation of class groups’, J. Amer. Math. Soc. 2 (1989) 839850.
18.Hanrot, G., Pujol, X. and Stehlé, D., ‘Analyzing blockwise lattice algorithms using dynamical systems’, Advances in Cryptology — CRYPTO 2011 — 31st Annual Cryptology Conference, Santa Barbara, CA, USA, August 14–18, 2011, Lecture Notes in Computer Science (ed. Rogaway, P.; Springer, 2011) 447464.
19.Hanrot, G. and Stehlé, D., ‘Improved analysis of Kannan’s shortest lattice vector algorithm’, Advances in Cryptology — CRYPTO 2007, Lecture Notes in Computer Science 4622 (ed. Menezes, A.; Springer, 2007) 170186.
20.Jao, D. and Soukharev, V., ‘A subexponential algorithm for evaluating large degree isogenies’, Algorithmic number theory, Lecture Notes in Computer Science 6197 (eds Hanrot, G., Morain, F. and Thomé, E.; Springer, 2010) 219233.
21.Jenner, W.E., ‘On zeta functions of number fields’, Duke Math. J. 36 (1969) 669671.
22.Joux, A., Lercier, R., Smart, N. P. and Vercauteren, F., ‘The number field sieve in the medium prime case’, Advances in Cryptology — CRYPTO 2006, 26th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20–24, 2006, Lecture Notes in Computer Science 4117 (ed. Dwork, Cynthia; Springer, 2006) 326344.
23.Lenstra, A. K., Lenstra, H. W. Jr., Manasse, M. S. and Pollard, J. M., ‘The number field sieve’, STOC ’90: Proceedings of The Twenty-Second Annual ACM Symposium on Theory of Computing (ACM, New York, NY, 1990) 564572.
24.Lenstra, A.K., ‘On the calculation of regulators and class numbers of quadratic fields’, Journées Arithmétiques (Cambridge University Press, 1982) 123150.
25.Micciancio, D. and Voulgaris, P., ‘A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations’, SIAM J. Comput. 42 (2013) no. 3, 13641391.
26.Neukirch, J., Algebraic number theory, Comprehensive Studies in Mathematics (Springer, 1999).
27.Novocin, A., Stehlé, D. and Villard, G., ‘An LLL-reduction algorithm with quasi-linear time complexity: Extended abstract’, Proceedings of the Forty-third Annual ACM Symposium on Theory of Computing, STOC ’11 (ACM, New York, NY, 2011) 403412.
28.Schnorr, C. P. and Euchner, M., ‘Lattice basis reduction: improved practical algorithms and solving subset sum problems’, Math. Program. 66 (1994) no. 2, 181199.
29.Schnorr, C.P., ‘A hierarchy of polynomial time lattice basis reduction algorithms’, Theor. Comput. Sci. 53 (1987) no. 2–3, 201224.
30.Scourfield, E., ‘On ideals free of large prime factors’, J. Théor. Nombres Bordeaux 16 (2004) no. 3, 733772.
31.Shanks, D., ‘Class number, a theory of factorization, and genera’, Proceedings of Symposia in Pure Mathematics 20 (eds LeVeque, W. J. and Straus, E. G.; American Mathematical Society, 1969) 415440.
32.Shanks, D., ‘The infrastructure of a real quadratic field and its applications’, Proceedings of the 1972 Number Theory Conference (American Mathematical Society, 1972) 217224.
33.Smart, N. and Vercauteren, F., ‘Fully homomorphic encryption with relatively small key and ciphertext sizes’, Public Key Cryptography — PKC 2010, Lecture Notes in Computer Science 6056 (eds Nguyen, P. and Pointcheval, D.; Springer, 2010) 420443.
34.Storjohann, A., ‘Algorithms for matrix canonical forms’, PhD Thesis, Department of Computer Science, Swiss Federal Institute of Technology – ETH, 2000.
35.Thiel, C., On the complexity of some problems in algorithmic algebraic number theory, PhD Thesis, Universität des Saarlandes, 1995.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

LMS Journal of Computation and Mathematics
  • ISSN: -
  • EISSN: 1461-1570
  • URL: /core/journals/lms-journal-of-computation-and-mathematics
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×
MathJax

MSC classification

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed