{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T03:13:10Z","timestamp":1783653190797,"version":"3.55.0"},"reference-count":35,"publisher":"Wiley","issue":"A","license":[{"start":{"date-parts":[[2014,8,1]],"date-time":"2014-08-01T00:00:00Z","timestamp":1406851200000},"content-version":"unspecified","delay-in-days":212,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["LMS J. Comput. Math."],"published-print":{"date-parts":[[2014]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>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.<\/jats:p>","DOI":"10.1112\/s1461157014000345","type":"journal-article","created":{"date-parts":[[2014,8,5]],"date-time":"2014-08-05T10:34:15Z","timestamp":1407234855000},"page":"385-403","source":"Crossref","is-referenced-by-count":37,"title":["Subexponential class group and unit group computation in large degree number fields"],"prefix":"10.1112","volume":"17","author":[{"given":"Jean-Fran\u00e7ois","family":"Biasse","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Claus","family":"Fieker","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"311","published-online":{"date-parts":[[2014,8,1]]},"reference":[{"key":"S1461157014000345_r35","unstructured":"35. C. Thiel , On the complexity of some problems in algorithmic algebraic number theory, PhD Thesis, Universit\u00e4t des Saarlandes, 1995."},{"key":"S1461157014000345_r32","first-page":"217","volume-title":"Proceedings of the 1972 Number Theory Conference","author":"Shanks","year":"1972"},{"key":"S1461157014000345_r27","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1145\/1993636.1993691","volume-title":"Proceedings of the Forty-third Annual ACM Symposium on Theory of Computing, STOC \u201911","author":"Novocin","year":"2011"},{"key":"S1461157014000345_r26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03983-0"},{"key":"S1461157014000345_r23","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100295"},{"key":"S1461157014000345_r20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14518-6_19"},{"key":"S1461157014000345_r17","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-1989-1002631-0"},{"key":"S1461157014000345_r16","doi-asserted-by":"publisher","DOI":"10.1137\/0406010"},{"key":"S1461157014000345_r15","first-page":"207","volume-title":"Proceedings of the 40th Annual ACM Symposium on Theory of Computing","author":"Gama","year":"2008"},{"key":"S1461157014000345_r14","doi-asserted-by":"publisher","DOI":"10.1007\/BF00536750"},{"key":"S1461157014000345_r12","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1996.0143"},{"key":"S1461157014000345_r10","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-017-1108-1_12"},{"key":"S1461157014000345_r9","first-page":"27","volume-title":"S\u00e9minaire de Th\u00e9orie des Nombres, Paris 1988\u20131989","author":"Buchmann","year":"1990"},{"key":"S1461157014000345_r8","unstructured":"8. G. Bisson , \u2018Endomorphism rings in cryptography\u2019, PhD Thesis, LORIA, Nancy, France, 2011."},{"key":"S1461157014000345_r7","doi-asserted-by":"crossref","unstructured":"7. J.-F. Biasse and C. Fieker , \u2018New techniques for computing the ideal class group and a system of fundamental units in number fields\u2019, Comp. Res. Repository, Preprint, 2012, arXiv:1204.1294.","DOI":"10.2140\/obs.2013.1.113"},{"key":"S1461157014000345_r6","unstructured":"6. J.-F. Biasse , \u2018Subexponential algorithms for number fields\u2019, PhD Thesis, \u00c9cole Polytechnique, Paris, 2011."},{"key":"S1461157014000345_r5","article-title":"Subexponential time relations in large degree number fields","author":"Biasse","journal-title":"Adv. Math. Commun."},{"key":"S1461157014000345_r4","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-2014-02651-3"},{"key":"S1461157014000345_r2","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1990-1023756-8"},{"key":"S1461157014000345_r1","first-page":"147","volume-title":"Advances in cryptology \u2014 CRYPTO \u201993, Proceedings of the 13th Annual International Cryptology Conference, Santa Barbara, California, USA, August 22\u201326, 1993","author":"Adleman","year":"1993"},{"key":"S1461157014000345_r28","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581144"},{"key":"S1461157014000345_r13","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-010-9057-y"},{"key":"S1461157014000345_r11","volume-title":"An introduction to the geometry of numbers","author":"Cassels","year":"1997"},{"key":"S1461157014000345_r19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74143-5_10"},{"key":"S1461157014000345_r21","doi-asserted-by":"publisher","DOI":"10.1215\/S0012-7094-69-03679-5"},{"key":"S1461157014000345_r34","unstructured":"34. A. Storjohann , \u2018Algorithms for matrix canonical forms\u2019, PhD Thesis, Department of Computer Science, Swiss Federal Institute of Technology \u2013 ETH, 2000."},{"key":"S1461157014000345_r31","first-page":"415","volume-title":"Proceedings of Symposia in Pure Mathematics 20","author":"Shanks","year":"1969"},{"key":"S1461157014000345_r29","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(87)90064-8"},{"key":"S1461157014000345_r25","doi-asserted-by":"publisher","DOI":"10.1137\/100811970"},{"key":"S1461157014000345_r3","first-page":"13","volume-title":"Number theory, CMS Conference Proceedings 15","author":"Bach","year":"1995"},{"key":"S1461157014000345_r22","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_19"},{"key":"S1461157014000345_r30","doi-asserted-by":"publisher","DOI":"10.5802\/jtnb.468"},{"key":"S1461157014000345_r24","first-page":"123","volume-title":"Journ\u00e9es Arithm\u00e9tiques","author":"Lenstra","year":"1982"},{"key":"S1461157014000345_r33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13013-7_25"},{"key":"S1461157014000345_r18","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1007\/978-3-642-22792-9_25","volume-title":"Advances in Cryptology \u2014 CRYPTO 2011 \u2014 31st Annual Cryptology Conference, Santa Barbara, CA, USA, August 14\u201318, 2011","author":"Hanrot","year":"2011"}],"container-title":["LMS Journal of Computation and Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1461157014000345","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,13]],"date-time":"2022-04-13T17:00:37Z","timestamp":1649869237000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1461157014000345\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"references-count":35,"journal-issue":{"issue":"A","published-print":{"date-parts":[[2014]]}},"alternative-id":["S1461157014000345"],"URL":"https:\/\/doi.org\/10.1112\/s1461157014000345","relation":{},"ISSN":["1461-1570"],"issn-type":[{"value":"1461-1570","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}