{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T10:37:58Z","timestamp":1761561478261},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540666660"},{"type":"electronic","value":"9783540480006"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/978-3-540-48000-6_16","type":"book-chapter","created":{"date-parts":[[2010,10,14]],"date-time":"2010-10-14T02:51:39Z","timestamp":1287024699000},"page":"195-207","source":"Crossref","is-referenced-by-count":16,"title":["Factorization of RSA-140 Using the Number Field Sieve"],"prefix":"10.1007","author":[{"given":"Stefania","family":"Cavallar","sequence":"first","affiliation":[]},{"given":"Bruce","family":"Dodson","sequence":"additional","affiliation":[]},{"given":"Arjen","family":"Lenstra","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Leyland","sequence":"additional","affiliation":[]},{"given":"Walter","family":"Lioen","sequence":"additional","affiliation":[]},{"given":"Peter L.","family":"Montgomery","sequence":"additional","affiliation":[]},{"given":"Brian","family":"Murphy","sequence":"additional","affiliation":[]},{"given":"Herman","family":"te Riele","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Zimmermann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BFb0000440","volume-title":"Advances in Cryptology - ASIACRYPT \u201994","author":"D. Atkins","year":"1995","unstructured":"Atkins, D., Graff, M., Lenstra, A.K., Leyland, P.C.: The Magicwords are Squeamish Ossifrage. In: Safavi-Naini, R., Pieprzyk, J.P. (eds.) ASIACRYPT 1994. LNCS, vol.\u00a0917, pp. 265\u2013277. Springer, Heidelberg (1995)"},{"unstructured":"Bosma, W., van der Hulst, M.-P.: Primality proving with cyclotomy. PhD thesis, University of Amsterdam (December 1990)","key":"16_CR2"},{"doi-asserted-by":"crossref","unstructured":"Buhler, J.P., Lenstra Jr., H.W., Pomerance, C.: Factoring integers with the number field sieve. In: [13], pp. 50\u201394","key":"16_CR3","DOI":"10.1007\/BFb0091539"},{"unstructured":"Cavallar, S.: Strategies for filtering in the Number Field Sieve. (in preparation)","key":"16_CR4"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1090\/S0025-5718-1987-0866102-2","volume":"48","author":"H. Cohen","year":"1987","unstructured":"Cohen, H., Lenstra, A.K.: Implementation of a new primality test. Mathematics of Computation\u00a048, 103\u2013121 (1987)","journal-title":"Mathematics of Computation"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/BFb0034863","volume-title":"Advances in Cryptology - ASIACRYPT \u201996","author":"J. Cowie","year":"1996","unstructured":"Cowie, J., Dodson, B., Elkenbracht-Huizing, R.-M., Lenstra, A.K., Montgomery, P.L., Zayer, J.: A world wide number field sieve factoring record: on to 512 bits. In: Kim, K.-c., Matsumoto, T. (eds.) ASIACRYPT 1996. LNCS, vol.\u00a01163, pp. 382\u2013394. Springer, Heidelberg (1996)"},{"unstructured":"CREST. Visit, http:\/\/www.crestco.co.uk\/","key":"16_CR7"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/3-540-48329-2_15","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"T. Denny","year":"1994","unstructured":"Denny, T., Dodson, B., Lenstra, A.K., Manasse, M.S.: On the factorization of RSA\u2013120. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 166\u2013174. Springer, Heidelberg (1994)"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1007\/3-540-44750-4_30","volume-title":"Advances in Cryptology - CRYPTO \u201995","author":"B. Dodson","year":"1995","unstructured":"Dodson, B., Lenstra, A.K.: NFS with four large primes: an explosive experiment. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol.\u00a0963, pp. 372\u2013385. Springer, Heidelberg (1995)"},{"unstructured":"Elkenbracht-Huizing, M.: Factoring integers with the number field sieve. PhD thesis, Leiden University (May 1997)","key":"16_CR10"},{"key":"16_CR11","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1080\/10586458.1996.10504590","volume":"5","author":"R.-M. Elkenbracht-Huizing","year":"1996","unstructured":"Elkenbracht-Huizing, R.-M.: An implementation of the number field sieve. Experimental Mathematics\u00a05, 231\u2013253 (1996)","journal-title":"Experimental Mathematics"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1007\/3-540-58691-1_38","volume-title":"Algorithmic Number Theory","author":"R. Golliver","year":"1994","unstructured":"Golliver, R., Lenstra, A.K., McCurley, K.S.: Lattice sieving and trial division. In: Huang, M.-D.A., Adleman, L.M. (eds.) ANTS 1994. LNCS, vol.\u00a0877, pp. 18\u201327. Springer, Heidelberg (1994)"},{"key":"16_CR13","series-title":"Lecture Notes in Mathematics","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. Lecture Notes in Mathematics, vol.\u00a01554, pp. 196, 197, 206, 207. Springer-Verlag, Berlin (1993)"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/3-540-46885-4_35","volume-title":"Advances in Cryptology - EUROCRYPT \u201989","author":"A.K. Lenstra","year":"1990","unstructured":"Lenstra, A.K., Manasse, M.S.: Factoring by electronic mail. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol.\u00a0434, pp. 355\u2013371. Springer, Heidelberg (1990)"},{"key":"16_CR15","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. In: Damg\u00e5rd, I.B. (ed.) EUROCRYPT 1990. LNCS, vol.\u00a0473, pp. 72\u201382. Springer, Heidelberg (1991)"},{"doi-asserted-by":"crossref","unstructured":": Square roots of products of algebraic numbers. In: Mathematics of Computation 1943\u20131993: a Half-Century of Computational Mathematics. Proceedings of Symposia in Applied Mathematics, pp. 567\u2013571. American Mathematical Society (1994)","key":"16_CR16","DOI":"10.1090\/psapm\/048\/1314892"},{"key":"16_CR17","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)"},{"unstructured":"Montgomery, P.L., Murphy, B.: Improved Polynomial Selection for the Number Field Sieve. In: Extended Abstract for the Conference on the Mathematics of Public-Key Cryptography, The Fields Institute, Toronto, Ontario, Canada, June 13\u201317 (1999)","key":"16_CR18"},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/BFb0054858","volume-title":"Algorithmic Number Theory","author":"B. Murphy","year":"1998","unstructured":"Murphy, B.: Modelling the Yield of Number Field Sieve Polynomials. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol.\u00a01423, pp. 137\u2013151. Springer, Heidelberg (1998)"},{"doi-asserted-by":"crossref","unstructured":"Pollard, J.M.: The lattice sieve. In: [13], pp. 43\u201349","key":"16_CR20","DOI":"10.1007\/BFb0091538"},{"key":"16_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/3-540-39757-4_17","volume-title":"Advances in Cryptology","author":"C. Pomerance","year":"1985","unstructured":"Pomerance, C.: The Quadratic Sieve Factoring algorithm. In: Beth, T., Cot, N., Ingemarsson, I. (eds.) EUROCRYPT 1984. LNCS, vol.\u00a0209, pp. 169\u2013182. Springer, Heidelberg (1985)"},{"key":"16_CR22","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R.L. Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Comm. ACM\u00a021, 120\u2013126 (1978)","journal-title":"Comm. ACM"},{"unstructured":"RSA Challenge Administrator. In order to obtain information about the RSA Factoring Challenge, send electronic mail to challenge-info@rsa.com and visit, http:\/\/www.rsa.com\/rsalabs\/html\/factoring.html","key":"16_CR23"},{"doi-asserted-by":"crossref","unstructured":"Shamir, A.: Factoring Large Numbers with the TWINKLE device. (Manuscript) (April 1999)","key":"16_CR24","DOI":"10.1007\/3-540-48059-5_2"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - ASIACRYPT\u201999"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-48000-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T08:55:45Z","timestamp":1559724945000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-48000-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540666660","9783540480006"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-48000-6_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]}}}