{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T20:05:45Z","timestamp":1749672345522,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319298139"},{"type":"electronic","value":"9783319298146"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-29814-6_16","type":"book-chapter","created":{"date-parts":[[2016,3,7]],"date-time":"2016-03-07T09:04:46Z","timestamp":1457341486000},"page":"199-211","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Strategy of Relations Collection in Factoring RSA Modulus"],"prefix":"10.1007","author":[{"given":"Haibo","family":"Yu","sequence":"first","affiliation":[]},{"given":"Guoqiang","family":"Bai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,5]]},"reference":[{"key":"16_CR1","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/BFb0091541","volume-title":"The Development of the Number Field Sieve","author":"DJ Bernstein","year":"1993","unstructured":"Bernstein, D.J., Lenstra, A.K.: A general number field sieve implementation. In: Lenstra, A.K., Lenstra, H.W. (eds.) The Development of the Number Field Sieve. Lecture Notes in Mathematics, vol. 1554, pp. 103\u2013126. Springer, Heidelberg (1993)"},{"key":"16_CR2","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/BFb0091538","volume-title":"The Development of the Number Field Sieve","author":"JM Pollard","year":"1993","unstructured":"Pollard, J.M.: The lattice sieve. In: Lenstra, A.K., Lenstra, H.W. (eds.) The Development of the Number Field Sieve. Lecture Notes in Mathematics, vol. 1554, pp. 43\u201349. Springer, Heidelberg (1993)"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-540-74735-2_25","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2007","author":"T Izu","year":"2007","unstructured":"Izu, T., Kogure, J., Shimoyama, T.: CAIRN 2: an FPGA implementation of the sieving step in the number field sieve method. In: Paillier, P., Verbauwhede, I. (eds.) CHES 2007. LNCS, vol. 4727, pp. 364\u2013377. Springer, Heidelberg (2007)"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-642-14623-7_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"T Kleinjung","year":"2010","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., Zimmermann, P.: Factorization of a 768-bit RSA modulus. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 333\u2013350. Springer, Heidelberg (2010)"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/3-540-58691-1_38","volume-title":"Algorithmic Number Theory","author":"RA Golliver","year":"1994","unstructured":"Golliver, R.A., Lenstra, A.K., McCurley, K.S.: Lattice sieving and trial division. In: Huang, M.-D.A., Adleman, L.M. (eds.) ANTS 1994. LNCS, vol. 877, pp. 18\u201327. Springer, Heidelberg (1994)"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/3-540-48059-5_2","volume-title":"Cryptographic Hardware and Embedded Systems","author":"A Shamir","year":"1999","unstructured":"Shamir, A.: Factoring large numbers with the TWINKLE device. In: Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 1999. LNCS, vol. 1717, pp. 2\u201312. Springer, Heidelberg (1999)"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-45146-4_1","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"A Shamir","year":"2003","unstructured":"Shamir, A., Tromer, E.: Factoring large numbers with the TWIRL device. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 1\u201326. Springer, Heidelberg (2003)"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/11545262_9","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2005","author":"J Franke","year":"2005","unstructured":"Franke, J., Kleinjung, T., Paar, C., Pelzl, J., Priplata, C., Stahlke, C.: SHARK: a realizable special hardware sieving device for factoring 1024-bit integers. In: Rao, J.R., Sunar, B. (eds.) CHES 2005. LNCS, vol. 3659, pp. 119\u2013130. Springer, Heidelberg (2005)"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/978-3-662-44709-3_19","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2014","author":"A Miele","year":"2014","unstructured":"Miele, A., Bos, J.W., Kleinjung, T., Lenstra, A.K.: Cofactorization on graphics processing units. In: Batina, L., Robshaw, M. (eds.) CHES 2014. LNCS, vol. 8731, pp. 335\u2013352. Springer, Heidelberg (2014)"},{"key":"16_CR10","unstructured":"Kleinjung, T.: Cofactorisation strategies for the number field sieve and an estimate for the sieving step for factoring 1024 bit integers. In: Proceedings of SHARCS, vol. 6 (2006)"},{"key":"16_CR11","volume-title":"Computer Arithmetic: Algorithms and Hardware Designs","author":"P Behrooz","year":"2000","unstructured":"Behrooz, P.: Computer Arithmetic: Algorithms and Hardware Designs, vol. 19. Oxford University Press, Oxford (2000)"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-540-40061-5_4","volume-title":"Advances in Cryptology - ASIACRYPT 2003","author":"AK Lenstra","year":"2003","unstructured":"Lenstra, A.K., Tromer, E., Shamir, A., Kortsmit, W., Dodson, B., Hughes, J., Leyland, P.: Factoring estimates for a 1024-bit RSA modulus. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 55\u201374. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Information and Communications Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-29814-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T06:16:14Z","timestamp":1623824174000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-29814-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319298139","9783319298146"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-29814-6_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"5 March 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}