{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T16:33:13Z","timestamp":1725985993109},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319979151"},{"type":"electronic","value":"9783319979168"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-97916-8_8","type":"book-chapter","created":{"date-parts":[[2018,7,25]],"date-time":"2018-07-25T08:13:24Z","timestamp":1532506404000},"page":"114-123","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["(Short Paper) Parameter Trade-Offs for\u00a0NFS and ECM"],"prefix":"10.1007","author":[{"given":"Kazumaro","family":"Aoki","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,26]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: 35th Annual Symposium on Foundations of Computer Science (FOCS 1994), pp. 124\u2013134. IEEE Computer Society (1994)","DOI":"10.1109\/SFCS.1994.365700"},{"key":"8_CR2","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0091534","volume-title":"The Development of the Number Field Sieve","year":"1993","unstructured":"Lenstra, A.K., Lenstra Jr., H.W. (eds.): The Development of the Number Field Sieve. LNM, vol. 1554. Springer, Heidelberg (1993). \n\t\t\t\t\t\thttps:\/\/doi.org\/10.1007\/BFb0091534"},{"issue":"3","key":"8_CR3","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF00198464","volume":"6","author":"D Coppersmith","year":"1993","unstructured":"Coppersmith, D.: Modifications to the number field sieve. J. Cryptology 6(3), 169\u2013180 (1993)","journal-title":"J. Cryptology"},{"issue":"256","key":"8_CR4","doi-asserted-by":"publisher","first-page":"2037","DOI":"10.1090\/S0025-5718-06-01870-9","volume":"75","author":"T Kleinjung","year":"2006","unstructured":"Kleinjung, T.: On polynomial selection for the general number field sieve. Math. Comput. 75(256), 2037\u20132047 (2006)","journal-title":"Math. Comput."},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-540-30539-2_8","volume-title":"Advances in Cryptology - ASIACRYPT 2004","author":"K Aoki","year":"2004","unstructured":"Aoki, K., Ueda, H.: Sieving using bucket sort. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol. 3329, pp. 92\u2013102. Springer, Heidelberg (2004). \n\t\t\t\t\t\thttps:\/\/doi.org\/10.1007\/978-3-540-30539-2_8"},{"key":"8_CR6","unstructured":"Papadopoulos, J.: A self-tuning filtering implementation for the number field sieve, CADO workshop on integer factorization. \n\t\t\t\t\t\thttp:\/\/cado.gforge.inria.fr\/workshop\/"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-76900-2_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"K Aoki","year":"2007","unstructured":"Aoki, K., Franke, J., Kleinjung, T., Lenstra, A.K., Osvik, D.A.: A kilobit special number field sieve factorization. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol. 4833, pp. 1\u201312. Springer, Heidelberg (2007). \n\t\t\t\t\t\thttps:\/\/doi.org\/10.1007\/978-3-540-76900-2_1"},{"key":"8_CR8","unstructured":"Abramowitz, M., Stegun, I.A.: Handbook of Mathematical Functions With Formulas, Graphs, and Mathematical Tables. Applied Mathematics Ser. vol. 55. National Bureau of Standards (1964). Tenth Printing, December 1972, with corrections"},{"key":"8_CR9","series-title":"A Computational Perspective","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-28979-8","volume-title":"Prime Numbers","author":"R Crandall","year":"2001","unstructured":"Crandall, R., Pomerance, C.: Prime Numbers. A Computational Perspective. Springer, New York (2001). \n\t\t\t\t\t\thttps:\/\/doi.org\/10.1007\/0-387-28979-8"},{"issue":"205","key":"8_CR10","first-page":"333","volume":"62","author":"D Coppersmith","year":"1994","unstructured":"Coppersmith, D.: Solving homogeneous linear equations over GF(2) via block Wiedemann algorithm. Math. Comput. 62(205), 333\u2013350 (1994)","journal-title":"Math. Comput."},{"issue":"3","key":"8_CR11","doi-asserted-by":"publisher","first-page":"649","DOI":"10.2307\/1971363","volume":"126","author":"HW Lenstra Jr","year":"1987","unstructured":"Lenstra Jr., H.W.: Factoring integers with elliptic curves. Ann. Math. 126(3), 649\u2013673 (1987)","journal-title":"Ann. Math."}],"container-title":["Lecture Notes in Computer Science","Advances in Information and Computer Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-97916-8_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,7,25]],"date-time":"2018-07-25T08:16:04Z","timestamp":1532506564000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-97916-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319979151","9783319979168"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-97916-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}