{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:00:16Z","timestamp":1772283616880,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642145179","type":"print"},{"value":"9783642145186","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14518-6_8","type":"book-chapter","created":{"date-parts":[[2010,7,8]],"date-time":"2010-07-08T06:45:55Z","timestamp":1278571555000},"page":"50-65","source":"Crossref","is-referenced-by-count":3,"title":["Practical Improvements to Class Group and Regulator Computation of Real Quadratic Fields"],"prefix":"10.1007","author":[{"given":"Jean-Fran\u00e7ois","family":"Biasse","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"suffix":"Jr.","given":"Michael J.","family":"Jacobson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"191","key":"8_CR1","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1090\/S0025-5718-1990-1023756-8","volume":"55","author":"E. Bach","year":"1990","unstructured":"Bach, E.: Explicit bounds for primality testing and related problems. Math. Comp.\u00a055(191), 355\u2013380 (1990)","journal-title":"Math. Comp."},{"key":"8_CR2","first-page":"13","volume-title":"Number Theory: CMS Proc.","author":"E. Bach","year":"1995","unstructured":"Bach, E.: Improved approximations for Euler products. In: Number Theory: CMS Proc., vol.\u00a015, pp. 13\u201328. Amer. Math. Soc., Providence (1995)"},{"key":"8_CR3","unstructured":"Bernstein, D.: How to find smooth parts of integers. Mathematics of Computation (submited)"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Biasse, J.-F.: Improvements in the computation of ideal class groups of imaginary quadratic number fields. In: Advances in Mathematics of Communications (to appear 2010)","DOI":"10.3934\/amc.2010.4.141"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Biasse, J.-F., Jacobson Jr., M.J., Silvester, A.K.: Security estimates for quadratic field based cryptosystems. In: ACISP (to appear 2010)","DOI":"10.1007\/978-3-642-14081-5_15"},{"key":"8_CR6","unstructured":"Buchmann, J.: A subexponential algorithm for the determination of class groups and regulators of algebraic number fields. In: S\u00e9minaire de Th\u00e9orie des Nombres (Paris), pp. 27\u201341 (1988-1989)"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Buchmann, J., D\u00fcllmann, S.: Distributed class group computation. In: Festschrift aus Anla\u00df des sechzigsten Geburtstages von Herrn Prof. Dr. G. Hotz, pp. 69\u201379. Universit\u00e4t des Saarlandes (1991), Teubner, Stuttgart (1992)","DOI":"10.1007\/978-3-322-95233-2_5"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/10722028_11","volume-title":"Algorithmic Number Theory","author":"S. Cavallar","year":"2000","unstructured":"Cavallar, S.: Strategies in filtering in the number field sieve. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol.\u00a01838, pp. 209\u2013232. Springer, Heidelberg (2000)"},{"key":"8_CR9","unstructured":"Chen, Z., Storjohann, A., Fletcher, C.: IML: Integer Matrix Library. Software (2010), \n                      http:\/\/www.cs.uwaterloo.ca\/~astorjoh\/iml.html"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","first-page":"446","volume-title":"Algorithmic Number Theory","author":"B. Dodson","year":"2002","unstructured":"Dodson, B., Leyland, P.C., Lenstra, A.K., Muffett, A., Wagstaff, S.: MPQS with three large primes. In: Fieker, C., Kohel, D.R. (eds.) ANTS 2002. LNCS, vol.\u00a02369, pp. 446\u2013460. Springer, Heidelberg (2002)"},{"key":"8_CR11","unstructured":"GMP, The GNU multiple precision bignum library. Software (2010), \n                      http:\/\/gmp-lib.org\/"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1090\/S0025-5718-07-02010-8","volume":"77","author":"J.E. Gower","year":"2008","unstructured":"Gower, J.E., Wagstaff, S.: Square form factorization. Mathematics of Computation\u00a077, 551\u2013588 (2008)","journal-title":"Mathematics of Computation"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1006\/jsco.1996.0141","volume":"24","author":"G. Havas","year":"1997","unstructured":"Havas, G., Majewski, B.S.: Integer matrix diagonalization. Journal of Symbolic Computing\u00a024, 399\u2013408 (1997)","journal-title":"Journal of Symbolic Computing"},{"key":"8_CR14","unstructured":"Jacobson Jr., M.J.: Subexponential class group computation in quadratic orders, Ph.D. thesis, Technische Universitt Darmstadt, Darmstadt, Germany (1999)"},{"key":"8_CR15","unstructured":"Jacobson Jr., M.J., Scheidler, R., Williams, H.C.: The efficiency and security of a real quadratic field based key exchange protocol. In: Public-Key Cryptography and Computational Number Theory, Warsaw, Poland, pp. 89\u2013112. de Gruyter (2001)"},{"key":"8_CR16","series-title":"CMS Books in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-84923-2","volume-title":"Solving the Pell equation","author":"M.J. Jacobson Jr.","year":"2009","unstructured":"Jacobson Jr., M.J., Williams, H.C.: Solving the Pell equation. CMS Books in Mathematics. Springer, Heidelberg (2009) ISBN 978-0-387-84922-5"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/3-540-46877-3_7","volume-title":"Advances in Cryptology - EUROCRYPT \u201990","author":"A.K. Lenstra","year":"1991","unstructured":"Lenstra, A.K., Manasse, M.S.: Factoring with two large primes (extended abstract). In: Damg\u00e5rd, I.B. (ed.) EUROCRYPT 1990. LNCS, vol.\u00a0473, pp. 72\u201382. Springer, Heidelberg (1991)"},{"key":"8_CR18","unstructured":"LiDIA Group, LiDIA: a c++ library for computational number theory. Software, Technische Universit\u00e4t Darmstadt, Germany (1997), \n                      http:\/\/www.informatik.tu-darmstadt.de\/TI\/LiDIA"},{"key":"8_CR19","unstructured":"LinBox, Project LinBox: Exact computational linear algebra. Software (2010), \n                      http:\/\/www.linalg.org\/"},{"issue":"240","key":"8_CR20","doi-asserted-by":"publisher","first-page":"1735","DOI":"10.1090\/S0025-5718-01-01367-9","volume":"71","author":"S. Louboutin","year":"2002","unstructured":"Louboutin, S.: Computation of class numbers of quadratic number fields. Math. Comp.\u00a071(240), 1735\u20131743 (2002)","journal-title":"Math. Comp."},{"key":"8_CR21","unstructured":"Maurer, M.: Regulator approximation and fundamental unit computation for real quadratic orders, Ph.D. thesis, Technische Universitt Darmstadt, Darmstadt, Germany (1999)"},{"key":"8_CR22","unstructured":"Milan, J.: Tifa. Software (2010), \n                      http:\/\/www.lix.polytechnique.fr\/Labo\/Jerome-Milan\/tifa\/tifa.xhtml"},{"key":"8_CR23","unstructured":"Shoup, V.: NTL: A Library for doing Number Theory. Software (2010), \n                      http:\/\/www-shoup.net\/ntl"},{"key":"8_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/3-540-45455-1_12","volume-title":"Algorithmic Number Theory","author":"U. Vollmer","year":"2002","unstructured":"Vollmer, U.: An accelerated Buchmann algorithm for regulator computation in real quadratic fields. In: Fieker, C., Kohel, D.R. (eds.) ANTS 2002. LNCS, vol.\u00a02369, pp. 148\u2013162. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Number Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14518-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T10:54:57Z","timestamp":1674816897000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-14518-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642145179","9783642145186"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14518-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}