{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T16:54:12Z","timestamp":1783529652310,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540205920","type":"print"},{"value":"9783540400615","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-40061-5_4","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T19:06:00Z","timestamp":1283713560000},"page":"55-74","source":"Crossref","is-referenced-by-count":26,"title":["Factoring Estimates for a 1024-Bit RSA Modulus"],"prefix":"10.1007","author":[{"given":"Arjen","family":"Lenstra","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eran","family":"Tromer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adi","family":"Shamir","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wil","family":"Kortsmit","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bruce","family":"Dodson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"James","family":"Hughes","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paul","family":"Leyland","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"Bach, E., Peralta, R.: Asymptotic semi-smoothness probabilities, University of Wisconsin, Technical report #1115 (October 1992)"},{"key":"4_CR2","unstructured":"Bernstein, D.J.: Circuits for integer factorization: a proposal (November 2001) (manuscript), available at http:\/\/cr.yp.to\/papers.html#nfscircuit"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0022-314X(83)90002-1","volume":"17","author":"E.R. Canfield","year":"1983","unstructured":"Canfield, E.R., Erd\u00f6s, P., Pomerance, C.: On a problem of Oppenheim concerning. Factorisatio Numerorum, J. Number Theory\u00a017, 1\u201328 (1983)","journal-title":"Factorisatio Numerorum, J. Number Theory"},{"key":"4_CR4","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., Lioen, W., Montgomery, P.L., Murphy, B., te Riele, H.J.J., et al.: Factorization of a 512-bit RSA modulus. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 1\u201317. Springer, Heidelberg (2000)"},{"key":"4_CR5","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. Journal of Cryptology \u00a06, 169\u2013180 (1993)","journal-title":"Journal of Cryptology"},{"key":"4_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-9316-0","volume-title":"Prime numbers","author":"R. Crandall","year":"2001","unstructured":"Crandall, R., Pomerance, C.: Prime numbers. Springer, Heidelberg (2001)"},{"key":"4_CR7","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/S1385-7258(66)50029-4","volume":"38","author":"N.G. Bruijn De","year":"1966","unstructured":"De Bruijn, N.G.: On the number of positive integers \u2264 x and free of prime factors > y, II. Indag. Math.\u00a038, 239\u2013247 (1966)","journal-title":"Indag. Math."},{"key":"4_CR8","unstructured":"International Technology Roadmap for Semiconductors 2002 Update (2002), http:\/\/public.itrs.net\/"},{"key":"4_CR9","unstructured":"Lambert, R.: Computational aspects of discrete logarithms, Ph.D. thesis, University of Waterloo (1996)"},{"key":"4_CR10","series-title":"Lecture Notes in Math.","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 Math., vol.\u00a01554. Springer, Heidelberg (1993)"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/3-540-45539-6_3","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"A.K. Lenstra","year":"2000","unstructured":"Lenstra, A.K., Shamir, A.: Analysis and optimization of the TWINKLE factoring device. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 35\u201352. Springer, Heidelberg (2000)"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-36178-2_1","volume-title":"Advances in Cryptology - ASIACRYPT 2002","author":"A.K. Lenstra","year":"2002","unstructured":"Lenstra, A.K., Shamir, A., Tomlinson, J., Tromer, E.: Analysis of Bernstein\u2019s factorization circuit. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol.\u00a02501, pp. 1\u201326. Springer, Heidelberg (2002)"},{"key":"4_CR13","unstructured":"Montgomery, P.L., Murphy, B.: Improved polynomial selection for the number field sieve, extended abstract for the conference on the mathematics of public-key cryptography, The Fields institute, Toronto, Ontario, Canada, June 13-17 (1999)"},{"key":"4_CR14","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 the number field sieve polynomials. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol.\u00a01423, pp. 137\u2013150. Springer, Heidelberg (1998)"},{"key":"4_CR15","unstructured":"Murphy, B.: Polynomial selection for the number field sieve integer factorisation algorithm, PhD thesis, The Australian National University (July 1999)"},{"key":"4_CR16","unstructured":"RSA Challenge Administrator, see http:\/\/www.rsasecurity.com\/rsalabs\/challenges\/factoring\/index.html"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Shamir, A., Tromer, E.: Factoring large numbers with the TWIRL device (preliminary draft) (February 4, 2003), available at www.wisdom.weizmann.ac.il\/~tromer\/papers\/twirl-20030208.ps.gz","DOI":"10.1007\/978-3-540-45146-4_1"},{"key":"4_CR18","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.\u00a02729, pp. 1\u201326. Springer, Heidelberg (2003)"},{"key":"4_CR19","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.\u00a01717, p. 2. Springer, Heidelberg (1999)"},{"key":"4_CR20","unstructured":"Silverman, R.D.: Optimal parameterization of SNFS, Manuscript (2002)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - ASIACRYPT 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-40061-5_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T17:17:38Z","timestamp":1559582258000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-40061-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540205920","9783540400615"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-40061-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}