{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T01:26:20Z","timestamp":1751073980392},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540675174"},{"type":"electronic","value":"9783540455394"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45539-6_1","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:26:08Z","timestamp":1184603168000},"page":"1-18","source":"Crossref","is-referenced-by-count":50,"title":["Factorization of a 512-Bit RSA Modulus"],"prefix":"10.1007","author":[{"given":"Stefania","family":"Cavallar","sequence":"first","affiliation":[]},{"given":"Bruce","family":"Dodson","sequence":"additional","affiliation":[]},{"given":"Arjen K.","family":"Lenstra","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":"Karen","family":"Aardal","sequence":"additional","affiliation":[]},{"given":"Jeff","family":"Gilchrist","sequence":"additional","affiliation":[]},{"given":"G\u00e9rard","family":"Guillerm","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Leyland","sequence":"additional","affiliation":[]},{"given":"J\u00f6el","family":"Marchand","sequence":"additional","affiliation":[]},{"given":"Fran\u00e7ois","family":"Morain","sequence":"additional","affiliation":[]},{"given":"Alec","family":"Muffett","sequence":"additional","affiliation":[]},{"given":"Chris and Craig","family":"Putnam","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Zimmermann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,5,12]]},"reference":[{"key":"1_CR1","first-page":"64","volume-title":"Proc. 23rd Annual ACM Symp. on Theory of Computing (STOC)","author":"L.M. Adleman","year":"1991","unstructured":"L.M. Adleman. Factoring numbers using singular integers. In Proc. 23rd Annual ACM Symp. on Theory of Computing (STOC), pages 64\u201371, ACM, New York, 1991."},{"key":"1_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BFb0000440","volume-title":"Advances in Cryptology \u2014 Asiacrypt\u2019 94","author":"D. Atkins","year":"1995","unstructured":"D. Atkins, M. Graff, A.K. Lenstra, and P.C. Leyland. THE MAGIC WORDS ARE SQUEAMISH OSSIFRAGE. In J. Pieprzyk and R. Safavi-Naini, editors, Advances in Cryptology \u2014 Asiacrypt\u2019 94, volume 917 of Lecture Notes in Computer Science, pages 265\u2013277, Springer-Verlag, Berlin, 1995."},{"key":"1_CR3","series-title":"Lect Notes Comput Sci","volume-title":"Public-Key Cryptography: State of the Art and Future Directions","year":"1992","unstructured":"Th. Beth, M. Frisch, and G.J. Simmons, editors. Public-Key Cryptography: State of the Art and Future Directions, volume 578 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1992. Report on workshop at Oberwolfach, Germany, July, 1991."},{"key":"1_CR4","unstructured":"Wieb Bosma and Marc-Paul van der Hulst. Primality proving with cyclotomy. PhD thesis, University of Amsterdam, December 1990."},{"key":"1_CR5","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Proc. Europar\u201999 (Toulouse, Sept. 1999)","author":"R. P. Brent","year":"1999","unstructured":"Richard P. Brent. Some parallel algorithms for integer factorisation. Proc. Europar\u201999 (Toulouse, Sept. 1999), volume 1685 of Lecture Notes in Computer Science, pages 1\u201322, Springer-Verlag, Berlin, 1999."},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"J. Brillhart, D.H. Lehmer, J.L. Selfridge, B. Tuckerman, and S.S. Wagstaff, Jr. Factorizations of b n \u00b1 1, b = 2, 3, 5, 6, 7, 10, 11,12 up to high powers, volume 22 of Contemporary Mathematics. American Mathematical Society, second edition, 1988.","DOI":"10.1090\/conm\/022"},{"key":"1_CR7","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/BFb0091539","volume-title":"The Development of the Number Field Sieve","author":"J.P. Buhler","year":"1993","unstructured":"J.P. Buhler, H.W. Lenstra, Jr., and Carl Pomerance. Factoring integers with the number field sieve. Pages 50\u201394 in H.W. Lenstra, Jr., editors. The Development of the Number Field Sieve, volume 1554 of Lecture Notes in Mathematics. Springer-Verlag, Berlin, 1993 [19]."},{"key":"1_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/978-3-540-48000-6_16","volume-title":"Advances in Cryptology \u2014 Asiacrypt\u2019 99 (Singapore, November 14\u201318)","author":"S. Cavallar","year":"1999","unstructured":"S. Cavallar, B. Dodson, A. Lenstra, P. Leyland, W. Lioen, P. L. Montgomery, B. Murphy, H. te Riele, and P. Zimmermann. Factorization of RSA-140 using the number field sieve. In Lam Kwok Yan, Eiji Okamoto, and Xing Chaoping, editors, Advances in Cryptology \u2014 Asiacrypt\u2019 99 (Singapore, November 14\u201318), volume 1716 of Lecture Notes in Computer Science, pages 195\u2013207, Springer-Verlag, Berlin, 1999."},{"key":"1_CR9","series-title":"Lect Notes Comput Sci","volume-title":"Strategies for filtering in the Number Field Sieve","author":"S. Cavallar","year":"2000","unstructured":"S. Cavallar. Strategies for filtering in the Number Field Sieve. Preprint, to appear in the Proceedings of ANTS-IV (Algorithmic Number Theory Symposium IV, Leiden, The Netherlands, July 2\u20137, 2000), Lecture Notes in Computer Science, Springer-Verlag, Berlin, 2000."},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"103","DOI":"10.2307\/2007877","volume":"48","author":"H. Cohen","year":"1987","unstructured":"H. Cohen and A.K. Lenstra. Implementation of a new primality test. Mathematics of Computation, 48:103\u2013121, 1987.","journal-title":"Mathematics of Computation"},{"key":"1_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/BFb0034863","volume-title":"Advances in Cryptology \u2014 Asiacrypt\u2019 96","author":"J. Cowie","year":"1996","unstructured":"James Cowie, Bruce Dodson, R.-Marije Elkenbracht-Huizing, Arjen K. Lenstra, Peter L. Montgomery, and J\u00f6rg Zayer. A world wide number field sieve factoring record: on to 512 bits. In Kwangjo Kim and Tsutomu Matsumoto, editors, Advances in Cryptology \u2014 Asiacrypt\u2019 96, volume 1163 of Lecture Notes in Computer Science, pages 382\u2013394, Springer-Verlag, Berlin, 1996."},{"key":"1_CR12","series-title":"Lecture Notes in Computer. Science","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/3-540-39757-4_18","volume-title":"Advances in Cryptology, Eurocrypt\u2019 84","author":"J.A. Davis","year":"1985","unstructured":"J.A. Davis, D.B. Holdridge, and G.J. Simmons. Status report on factoring (at the Sandia National Laboratories). In T. Beth, N. Cot, and I. Ingemarsson, editors, Advances in Cryptology, Eurocrypt\u2019 84, volume 209 of Lecture Notes in Computer. Science, pages 183\u2013215, Springer-Verlag, Berlin, 1985.."},{"key":"1_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/3-540-48329-2_15","volume-title":"Advances in Cryptology \u2014 Crypto\u2019 93","author":"T. Denny","year":"1994","unstructured":"T. Denny, B. Dodson, A.K. Lenstra, and M.S. Manasse, On the factorization of RSA-120. In D.R. Stinson, editor, Advances in Cryptology \u2014 Crypto\u2019 93, volume 773 of Lecture Notes in Computer Science, pages 166\u2013174, Springer-Verlag, Berlin, 1994."},{"key":"1_CR14","series-title":"Lecture Notes in Computer. Science","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/3-540-48285-7_3","volume-title":"Advances in Cryptology, Eurocrypt\u2019 93","author":"B. Dixon","year":"1994","unstructured":"B. Dixon and A.K. Lenstra. Factoring using SIMD Sieves. In Tor Helleseth, editor, Advances in Cryptology, Eurocrypt\u2019 93, volume 765 of Lecture Notes in Computer. Science, pages 28\u201339, Springer-Verlag, Berlin, 1994."},{"key":"1_CR15","unstructured":"Marije Elkenbracht-Huizing. Factoring integers with the number field sieve. PhD thesis, Leiden University, May 1997."},{"key":"1_CR16","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1080\/10586458.1996.10504590","volume":"5","author":"R.-M. Elkenbracht-Huizing","year":"1996","unstructured":"R.-M. Elkenbracht-Huizing. An implementation of the number field sieve. Experimental Mathematics, 5:231\u2013253, 1996.","journal-title":"Experimental Mathematics"},{"key":"1_CR17","unstructured":"Frequently Asked Questions about today\u2019s Cryptography 4.0. Question 3.1.9, see http:\/\/www.rsa.com\/rsalabs\/faq\/html\/3-1-9.html ."},{"key":"1_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1007\/3-540-58691-1_38","volume-title":"Algorithmic Number Theory, (ANTS-I, Ithaca, NY, USA, May 1994)","author":"R. Golliver","year":"1994","unstructured":"R. Golliver, A.K. Lenstra, and K.S. McCurley. Lattice sieving and trial division. In Leonard M. Adleman and Ming-Deh Huang, editors, Algorithmic Number Theory, (ANTS-I, Ithaca, NY, USA, May 1994), volume 877 of Lecture Notes in Computer Science, pages 18\u201327, Springer-Verlag, Berlin, 1994."},{"key":"1_CR19","series-title":"Lecture Notes in Mathematics","volume-title":"The Development of the Number Field Sieve","year":"1993","unstructured":"A.K. Lenstra and H.W. Lenstra, Jr., editors. The Development of the Number Field Sieve, volume 1554 of Lecture Notes in Mathematics. Springer-Verlag, Berlin, 1993"},{"issue":"203","key":"1_CR20","doi-asserted-by":"publisher","first-page":"319","DOI":"10.2307\/2152957","volume":"61","author":"A.K. Lenstra","year":"1993","unstructured":"A.K. Lenstra, H.W. Lenstra, Jr., M.S. Manasse, and J.M. Pollard. The factorization of the Ninth Fermat number. Mathematics of Computation, 61(203):319\u2013349, July 1993.","journal-title":"Mathematics of Computation"},{"key":"1_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/3-540-46885-4_35","volume-title":"Advances in Cryptology \u2014 Eurocrypt\u2019 89","author":"A.K. Lenstra","year":"1990","unstructured":"A.K. Lenstra and M.S. Manasse. Factoring by Electronic Mail. In J.-J. Quisquater and J. Vandewalle, editors, Advances in Cryptology \u2014 Eurocrypt\u2019 89, volume 434 of Lecture Notes in Computer Science, pages 355\u2013371, Springer-Verlag, Berlin, 1990."},{"key":"1_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/3-540-46877-3_7","volume-title":"Advances in Cryptology \u2014 Eurocrypt\u2019 90","author":"A.K. Lenstra","year":"1991","unstructured":"A.K. Lenstra and M.S. Manasse. Factoring with two large primes. In I.B. D\u00e5mgard, editor, Advances in Cryptology \u2014 Eurocrypt\u2019 90, volume 473 of Lecture Notes in Computer Science, pages 72\u201382, Springer-Verlag, Berlin, 1991."},{"key":"1_CR23","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1007\/978-3-540-46588-1_30","volume-title":"Public Key Cryptography","author":"A. K. Lenstra","year":"2000","unstructured":"Arjen K. Lenstra and Eric R. Verheul. Selecting Cryptographic Key Sizes. In H. Imai and Y. Zheng, editors, Public Key Cryptography, volume 1751 of Lecture Notes in Computer Science, pages 446\u2013465, Springer-Verlag, Berlin, 2000."},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Peter L. Montgomery. Square roots of products of algebraic numbers. In Walter Gautschi, editor, Mathematics of Computation 1943\u20131993: a Half-Century of Computational Mathematics, pages 567\u2013571. Proceedings of Symposia in Applied Mathematics, American Mathematical Society, 1994.","DOI":"10.1090\/psapm\/048\/1314892"},{"key":"1_CR25","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1007\/3-540-49264-X_9","volume-title":"Advances in Cryptology \u2014 Eurocrypt\u2019 95","author":"P. L. Montgomery","year":"1995","unstructured":"Peter L. Montgomery. A block Lanczos algorithm for finding dependencies over GF(2). In Louis C. Guillou and Jean-Jacques Quisquater, editors, Advances in Cryptology \u2014 Eurocrypt\u2019 95, volume 921 of Lecture Notes in Computer Science, pages 106\u2013120, Springer-Verlag, Berlin, 1995."},{"key":"1_CR26","volume-title":"Extended Abstract for the Conference on the Mathematics of Public-Key Cryptography","author":"P. L. Montgomery","year":"1999","unstructured":"Peter L. Montgomery and Brian Murphy. Improved Polynomial Selection for the Number Field Sieve. Extended Abstract for the Conference on the Mathematics of Public-Key Cryptography, June 13\u201317, 1999, The Fields Institute, Toronto, Ontario, Canada."},{"issue":"2","key":"1_CR27","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1090\/S0002-9904-1971-12711-8","volume":"77","author":"M. A. Morrison","year":"1971","unstructured":"Michael A. Morrison and John Brillhart. The factorization of F 7. Bull. Amer. Math. Soc., 77(2):264, 1971.","journal-title":"Bull. Amer. Math. Soc."},{"key":"1_CR28","doi-asserted-by":"publisher","first-page":"183","DOI":"10.2307\/2005475","volume":"29","author":"M. A. Morrison","year":"1975","unstructured":"Michael A. Morrison and John Brillhart. A method of factoring and the factorization of F 7. Mathematics of Computation, 29:183\u2013205, January 1975.","journal-title":"Mathematics of Computation"},{"key":"1_CR29","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BFb0054858","volume-title":"Algorithmic Number Theory, (Third International Symposium, ANTS-III, Portland, Oregon, USA, June 1998)","author":"B. Murphy","year":"1998","unstructured":"B. Murphy. Modelling the Yield of Number Field Sieve Polynomials. J. Buhler, editor, Algorithmic Number Theory, (Third International Symposium, ANTS-III, Portland, Oregon, USA, June 1998), volume 1423 of Lecture Notes in Computer Science, pages 137\u2013151, Springer-Verlag, Berlin, 1998."},{"key":"1_CR30","unstructured":"Brian Antony Murphy. Polynomial Selection for the Number Field Sieve Integer Factorisation Algorithm. PhD thesis, The Australian National University, July 1999."},{"key":"1_CR31","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":"J.M. Pollard","year":"1993","unstructured":"J.M. Pollard. The lattice sieve. Pages 43\u201349 in H.W. Lenstra, Jr., editors. The Development of the Number Field Sieve, volume 1554 of Lecture Notes in Mathematics. Springer-Verlag, Berlin, 1993 [19]."},{"key":"1_CR32","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0377-0427(89)90370-1","volume":"27","author":"H. Riele te","year":"1989","unstructured":"Herman te Riele, Walter Lioen, and Dik Winter. Factoring with the quadratic sieve on large vector computers. J. Comp. Appl. Math., 27:267\u2013278, 1989.","journal-title":"J. Comp. Appl. Math."},{"key":"1_CR33","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R.L. Rivest","year":"1978","unstructured":"R.L. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Comm. ACM, 21:120\u2013126, 1978.","journal-title":"Comm. ACM"},{"key":"1_CR34","unstructured":"RSA Challenge Administrator. In order to obtain information about the RSA Factoring Challenge, send electronic mail to challenge-info@rsa.com. The status of the factored numbers on the RSA Challenge List can be obtained by sending electronic mail to challenge-honor-rolls@majordomo.rsasecurity.com. Also visit http:\/\/www.rsa.com\/rsalabs\/html\/factoring.html ."},{"key":"1_CR35","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48059-5_2","volume-title":"Cryptographic Hardware and Embedded Systems (CHES)","author":"A. Shamir","year":"1999","unstructured":"A. Shamir. Factoring large numbers with the TWINKLE device. In C.K. Koc and C. Paar, editors, Cryptographic Hardware and Embedded Systems (CHES), volume 1717 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1999."},{"key":"1_CR36","doi-asserted-by":"publisher","first-page":"329","DOI":"10.2307\/2007894","volume":"48","author":"R. D. Silverman","year":"1987","unstructured":"Robert D. Silverman. The multiple polynomial quadratic sieve. Mathematics of Computation, 48:329\u2013339, 1987.","journal-title":"Mathematics of Computation"},{"key":"1_CR37","unstructured":"Robert D. Silverman. Private communication."},{"key":"1_CR38","unstructured":"URL: http:\/\/www.bxa.doc.gov\/Encryption\/Default.htm ."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45539-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T03:37:50Z","timestamp":1556681870000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45539-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540675174","9783540455394"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/3-540-45539-6_1","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}