{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T22:18:35Z","timestamp":1761949115935,"version":"build-2065373602"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540768999"},{"type":"electronic","value":"9783540769002"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"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":[[2007]]},"DOI":"10.1007\/978-3-540-76900-2_1","type":"book-chapter","created":{"date-parts":[[2007,11,5]],"date-time":"2007-11-05T01:38:44Z","timestamp":1194226724000},"page":"1-12","source":"Crossref","is-referenced-by-count":29,"title":["A Kilobit Special Number Field Sieve Factorization"],"prefix":"10.1007","author":[{"given":"Kazumaro","family":"Aoki","sequence":"first","affiliation":[]},{"given":"Jens","family":"Franke","sequence":"additional","affiliation":[]},{"given":"Thorsten","family":"Kleinjung","sequence":"additional","affiliation":[]},{"given":"Arjen K.","family":"Lenstra","sequence":"additional","affiliation":[]},{"given":"Dag Arne","family":"Osvik","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","unstructured":"Aoki, K., Kida, Y., Shimoyama, T., Ueda, H.: \n                    \n                      http:\/\/www.crypto-world.com\/announcements\/SNFS274.txt"},{"key":"1_CR2","unstructured":"Aoki, K., Shimoyama, T.: R311 is factored by ECM, Proceedings of SCIS 2004, no.2E1-1, Hiroshima, Japan, Technical Group on Information Security (IEICE) (in Japanese)"},{"key":"1_CR3","unstructured":"Bahr, F.: Liniensieben und Quadratwurzelberechnung f\u00fcr das Zahlk\u00f6rpersieb, University of Bonn (2005)"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/10722028_11","volume-title":"ANTS IV","author":"S. Cavallar","year":"2000","unstructured":"Cavallar, S.: Strategies for filtering in the number field sieve. In: Bosma, W. (ed.) ANTS IV. LNCS, vol.\u00a01838, pp. 209\u2013231. Springer, Heidelberg (2000)"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45539-6_1","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"S. Cavallar","year":"2000","unstructured":"Cavallar, S., Dodson, B., Lenstra, A.K., Leyland, P., Montgomery, P.L., Murphy, B., te Riele, H., Zimmermann, P., et al.: Factoring a 512-bit RSA modulus. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 1\u201318. Springer, Heidelberg (2000)"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0024-3795(93)90235-G","volume":"192","author":"D. Coppersmith","year":"1993","unstructured":"Coppersmith, D.: Solving linear equations over GF(2): block Lanczos algorithm. Linear algebra and its applications\u00a0192, 33\u201360 (1993)","journal-title":"Linear algebra and its applications"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"333","DOI":"10.2307\/2153413","volume":"62","author":"D. Coppersmith","year":"1994","unstructured":"Coppersmith, D.: Solving homogeneous linear equations over GF(2) via block Wiedemann algorithm. Math. of Comp.\u00a062, 333\u2013350 (1994)","journal-title":"Math. of Comp."},{"key":"1_CR8","unstructured":"Franke, J., Kleinjung, T.: Continued fractions and lattice sieving. In: Proceedings SHARCS 2005, \n                    \n                      http:\/\/www.ruhr-uni-bochum.de\/itsc\/tanja\/SHARCS\/talks\/FrankeKleinjung.pdf"},{"key":"1_CR9","unstructured":"Kleinjung, T.: Cofactorisation strategies for the number field sieve and an estimate for the sieving step for factoring 1024-bit integers. In: Proceedings SHARCS 2006, \n                    \n                      http:\/\/www.hyperelliptic.org\/tanja\/SHARCS\/talks06\/thorsten.pdf\n                    \n                    \n                  ."},{"key":"1_CR10","series-title":"LNM","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, H.W.: The development of the number field sieve. LNM, vol.\u00a01554. Springer, Heidelberg (1993)"},{"key":"1_CR11","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s00145-001-0009-4","volume":"14","author":"A.K. Lenstra","year":"2001","unstructured":"Lenstra, A.K., Verheul, E.R.: Selecting cryptographic key sizes, J. of Cryptology\u00a014, 255\u2013293 (2001)","journal-title":"of Cryptology"},{"key":"1_CR12","first-page":"649","volume":"126","author":"H.W. Lenstra","year":"1987","unstructured":"Lenstra, H.W.: Factoring integers with elliptic curves, Ann. of Math.\u00a0126, 649\u2013673 (1987)","journal-title":"of Math."},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1007\/3-540-49264-X_9","volume-title":"Advances in Cryptology - EUROCRYPT \u201995","author":"P.L. Montgomery","year":"1995","unstructured":"Montgomery, P.L.: A block Lanczos algorithm for finding dependencies over GF(2). In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol.\u00a0921, pp. 106\u2013120. Springer, Heidelberg (1995)"},{"key":"1_CR14","unstructured":"Montgomery, P.L.: Square roots of products of algebraic numbers, \n                    \n                      http:\/\/ftp.cwi.nl\/pub\/pmontgom\/sqrt.ps.gz"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BFb0054859","volume-title":"ANTS III","author":"P. Nguyen","year":"1998","unstructured":"Nguyen, P.: A Montgomery-like square root for the number field sieve. In: Buhler, J.P. (ed.) ANTS III. LNCS, vol.\u00a01423, pp. 151\u2013168. Springer, Heidelberg (1998)"},{"key":"1_CR16","unstructured":"Pomerance, C.: A tale of two sieves, \n                    \n                      http:\/\/www.ams.org\/notices\/199612\/pomerance.pdf"},{"key":"1_CR17","unstructured":"Prime95, \n                    \n                      http:\/\/www.mersenne.org\/freesoft.htm"},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1006\/jsco.2002.0533","volume":"33","author":"E. Thom\u00e9","year":"2002","unstructured":"Thom\u00e9, E.: Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm. Journal of symbolic computation\u00a033, 757\u2013775 (2002)","journal-title":"Journal of symbolic computation"},{"key":"1_CR19","unstructured":"Zimmermann, P.: \n                    \n                      http:\/\/gforge.inria.fr\/projects\/ecm\/"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76900-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T14:52:57Z","timestamp":1558277577000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76900-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540768999","9783540769002"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76900-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}