{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T20:55:18Z","timestamp":1769720118096,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642140808","type":"print"},{"value":"9783642140815","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-14081-5_15","type":"book-chapter","created":{"date-parts":[[2010,9,24]],"date-time":"2010-09-24T16:22:49Z","timestamp":1285345369000},"page":"233-247","source":"Crossref","is-referenced-by-count":16,"title":["Security Estimates for Quadratic Field Based Cryptosystems"],"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"}]},{"given":"Alan K.","family":"Silvester","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"191","key":"15_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":"15_CR2","unstructured":"Bernstein, D.: How to find smooth parts of integers. Submitted to Mathematics of Computation"},{"key":"15_CR3","unstructured":"Biasse, J.-F.: Improvements in the computation of ideal class groups of imaginary quadratic number fields. To appear in Advances in Mathematics of Communications, \n                    \n                      http:\/\/www.lix.polytechnique.fr\/~biasse\/papers\/biasseCHILE.pdf"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Biasse, J.-F., Jacobson Jr., M.J.: Practical improvements to class group and regulator computation of real quadratic fields. To appear in ANTS 9 (2010)","DOI":"10.1007\/978-3-642-14518-6_8"},{"key":"15_CR5","unstructured":"Buchmann, J.: A subexponential algorithm for the determination of class groups and regulators of algebraic number fields. S\u00e9minaire de Th\u00e9orie des Nombres (Paris), pp. 27\u201341 (1988\u20131989)"},{"key":"15_CR6","volume-title":"Algorithms and Computation in Mathematics","author":"J. Buchmann","year":"2007","unstructured":"Buchmann, J., Vollmer, U.: Binary quadratic forms: An algorithmic approach. In: Algorithms and Computation in Mathematics, vol.\u00a020. Springer, Berlin (2007)"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF02351719","volume":"1","author":"J. Buchmann","year":"1988","unstructured":"Buchmann, J., Williams, H.C.: A key-exchange system based on imaginary quadratic fields. Journal of Cryptology\u00a01, 107\u2013118 (1988)","journal-title":"Journal of Cryptology"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/0-387-34805-0_31","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"J. Buchmann","year":"1990","unstructured":"Buchmann, J., Williams, H.C.: A key-exchange system based on real quadratic fields. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 335\u2013343. Springer, Heidelberg (1990)"},{"key":"15_CR9","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":"15_CR10","unstructured":"Chen, Z., Storjohann, A., Fletcher, C.: IML: Integer Matrix Library (2007), \n                    \n                      http:\/\/www.cs.uwaterloo.ca\/~z4chen\/iml.html"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Cohen, H., Lenstra Jr., H.W.: Heuristics on class groups of number fields. In: Number Theory. Lecture Notes in Math., vol.\u00a01068, pp. 33\u201362. Springer, New York (1983)","DOI":"10.1007\/BFb0099440"},{"key":"15_CR12","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1090\/S0894-0347-1989-1002631-0","volume":"2","author":"J.L. Hafner","year":"1989","unstructured":"Hafner, J.L., McCurley, K.S.: A rigorous subexponential algorithm for computation of class groups. J. Amer. Math. Soc.\u00a02, 837\u2013850 (1989)","journal-title":"J. Amer. Math. Soc."},{"key":"15_CR13","unstructured":"Hamdy, S.: \u00dcber die Sicherheit und Effizienz kryptografischer Verfahren mit Klassengruppen imagin\u00e4r-quadratischer Zahlk\u00f6rper. Ph.D. thesis, Technische Universit\u00e4t Darmstadt, Darmstadt, Germany (2002)"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/3-540-44448-3_18","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"S. Hamdy","year":"2000","unstructured":"Hamdy, S., M\u00f6ller, B.: Security of cryptosystems based on class groups of imaginary quadratic orders. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 234\u2013247. Springer, Heidelberg (2000)"},{"issue":"3","key":"15_CR15","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1023\/A:1025746127771","volume":"30","author":"D. H\u00fchnlein","year":"2003","unstructured":"H\u00fchnlein, D., Jacobson Jr., M.J., Weber, D.: Towards practical non-interactive public-key cryptosystems using non-maximal imaginary quadratic orders. Designs, Codes and Cryptography\u00a030(3), 281\u2013299 (2003)","journal-title":"Designs, Codes and Cryptography"},{"key":"15_CR16","unstructured":"Imbert, L., Jacobson Jr., M.J., Schmidt, A.: Fast ideal cubing in imaginary quadratic number and function fields. To appear in to Advances in Mathematics of Communication (2010)"},{"key":"15_CR17","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/s001450010013","volume":"13","author":"M.J. Jacobson Jr.","year":"2000","unstructured":"Jacobson Jr., M.J.: Computing discrete logarithms in quadratic orders. Journal of Cryptology\u00a013, 473\u2013492 (2000)","journal-title":"Journal of Cryptology"},{"key":"15_CR18","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":"15_CR19","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s00145-005-0357-6","volume":"19","author":"M.J. Jacobson Jr.","year":"2006","unstructured":"Jacobson Jr., M.J., Scheidler, R., Williams, H.C.: An improved real quadratic field based key exchange procedure. Journal of Cryptology\u00a019, 211\u2013239 (2006)","journal-title":"Journal of Cryptology"},{"key":"15_CR20","doi-asserted-by":"crossref","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","DOI":"10.1007\/978-0-387-84923-2_15"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Kleinjung, T., Aoki, K., Franke, J., Lenstra, A.K., Thom\u00e9, E., Bos, J.W., Gaudry, P., Kruppa, A., Montgomery, P.L., Osvik, D.A., te Riele, H., Timofeev, A., Zimmerman, P.: Factorization of a 768-bit RSA modulus, Eprint archive no.\u00a02010\/006 (2010)","DOI":"10.1007\/978-3-642-14623-7_18"},{"key":"15_CR22","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0091534","volume-title":"The development of the number field sieve","author":"A.K. Lenstra","year":"1993","unstructured":"Lenstra, A.K., Lenstra Jr., H.W.: The development of the number field sieve. Lecture Notes in Mathematics, vol.\u00a01554. Springer, Berlin (1993)"},{"key":"15_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1007\/978-3-540-46588-1_30","volume-title":"Public Key Cryptography","author":"A.K. Lenstra","year":"2000","unstructured":"Lenstra, A.K., Verheul, E.: Selecting cryptographic key sizes. In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol.\u00a01751, pp. 446\u2013465. Springer, Heidelberg (2000)"},{"key":"15_CR24","unstructured":"Maurer, M.: Regulator approximation and fundamental unit computation for real-quadratic orders, Ph.D. thesis, Technische Universit\u00e4t Darmstadt, Darmstadt, Germany (2000)"},{"key":"15_CR25","unstructured":"National Institute of Standards and Technology (NIST), Recommendation for Key Management \u2014 Part 1: General (Revised), NIST Special Publication 800-57 (March 2007), \n                    \n                      http:\/\/csrc.nist.gov\/groups\/ST\/toolkit\/documents\/SP800-57Part1_3-8-07.pdf"},{"key":"15_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/10722028_39","volume-title":"Algorithmic Number Theory","author":"U. Vollmer","year":"2000","unstructured":"Vollmer, U.: Asymptotically fast discrete logarithms in quadratic number fields. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol.\u00a01838, pp. 581\u2013594. Springer, Heidelberg (2000)"},{"key":"15_CR27","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)"},{"key":"15_CR28","unstructured":"Vollmer, U.: Rigorously analyzed algorithms for the discrete logarithm problem in quadratic number fields, Ph.D. thesis, Technische Universit\u00e4t Darmstadt (2003)"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14081-5_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T22:27:52Z","timestamp":1580336872000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14081-5_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642140808","9783642140815"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14081-5_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}