{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T11:29:24Z","timestamp":1774610964661,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642146220","type":"print"},{"value":"9783642146237","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14623-7_18","type":"book-chapter","created":{"date-parts":[[2010,8,10]],"date-time":"2010-08-10T04:15:26Z","timestamp":1281413726000},"page":"333-350","source":"Crossref","is-referenced-by-count":200,"title":["Factorization of a 768-Bit RSA Modulus"],"prefix":"10.1007","author":[{"given":"Thorsten","family":"Kleinjung","sequence":"first","affiliation":[]},{"given":"Kazumaro","family":"Aoki","sequence":"additional","affiliation":[]},{"given":"Jens","family":"Franke","sequence":"additional","affiliation":[]},{"given":"Arjen K.","family":"Lenstra","sequence":"additional","affiliation":[]},{"given":"Emmanuel","family":"Thom\u00e9","sequence":"additional","affiliation":[]},{"given":"Joppe W.","family":"Bos","sequence":"additional","affiliation":[]},{"given":"Pierrick","family":"Gaudry","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Kruppa","sequence":"additional","affiliation":[]},{"given":"Peter L.","family":"Montgomery","sequence":"additional","affiliation":[]},{"given":"Dag Arne","family":"Osvik","sequence":"additional","affiliation":[]},{"given":"Herman","family":"te Riele","sequence":"additional","affiliation":[]},{"given":"Andrey","family":"Timofeev","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Zimmermann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","first-page":"64","volume-title":"STOC","author":"L.M. Adleman","year":"1991","unstructured":"Adleman, L.M.: Factoring numbers using singular integers. In: STOC, pp. 64\u201371. ACM, New York (1991)"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-76900-2_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"K. Aoki","year":"2007","unstructured":"Aoki, K., Franke, J., Kleinjung, T., Lenstra, A.K., Osvik, D.A.: A kilobit special number field sieve factorization. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol.\u00a04833, pp. 1\u201312. Springer, Heidelberg (2007)"},{"key":"18_CR3","unstructured":"Bahr, F.: Liniensieben und Quadratwurzelberechnung f\u00fcr das Zahlk\u00f6rpersieb, Diplomarbeit, University of Bonn (2005)"},{"key":"18_CR4","unstructured":"Bahr, F., B\u00f6hm, M., Franke, J., Kleinjung, T.: Factorization of RSA-200 (May 2005), \n                    \n                      http:\/\/www.loria.fr\/~zimmerma\/records\/rsa200"},{"key":"18_CR5","unstructured":"Buhler, J., Montgomery, P., Robson, R., Ruby, R.: Implementing the number field sieve. Technical report, Oregon State University (1994)"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/10722028_11","volume-title":"Algorithmic Number Theory","author":"S. Cavallar","year":"2000","unstructured":"Cavallar, S.: Strategies in filtering in the number field sieve. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol.\u00a01838, pp. 209\u2013232. Springer, Heidelberg (2000)"},{"key":"18_CR7","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.M., Montgomery, P.L., Murphy, B., te Riele, H.J.J., Aardal, K., Gilchrist, J., Guillerm, G., Leyland, P.C., Marchand, J., Morain, F., Muffett, A., Putnam, C., Putnam, C., Zimmermann, P.: Factorization of a 512-bit RSA modulus. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 1\u201318. Springer, Heidelberg (2000)"},{"key":"18_CR8","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"},{"issue":"205","key":"18_CR9","first-page":"333","volume":"62","author":"D. Coppersmith","year":"1994","unstructured":"Coppersmith, D.: Solving homogeneous linear equations over GF(2) via block Wiedemann algorithm. Math. Comput.\u00a062(205), 333\u2013350 (1994)","journal-title":"Math. Comput."},{"key":"18_CR10","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)"},{"key":"18_CR11","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1090\/S0025-5718-1981-0595059-1","volume":"36","author":"J.D. Dixon","year":"1981","unstructured":"Dixon, J.D.: Asymptotically fast factorization of integers. Math. Comp.\u00a036, 255\u2013260 (1981)","journal-title":"Math. Comp."},{"key":"18_CR12","unstructured":"Franke, J., Kleinjung, T.: Continued fractions and lattice sieving. In: Workshop record of SHARCS (2005), \n                    \n                      http:\/\/www.ruhr-uni-bochum.de\/itsc\/tanja\/SHARCS\/talks\/FrankeKleinjung.pdf"},{"key":"18_CR13","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.A. 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.\u00a0877, pp. 18\u201327. Springer, Heidelberg (1994)"},{"key":"18_CR14","unstructured":"Kleinjung, T.: Cofactorisation strategies for the number field sieve and an estimate for the sieving step for factoring 1024 bit integers. In: Workshop record of SHARCS (2005), \n                    \n                      http:\/\/www.hyperelliptic.org\/tanja\/SHARCS\/talks06\/thorsten.pdf"},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"2037","DOI":"10.1090\/S0025-5718-06-01870-9","volume":"75","author":"T. Kleinjung","year":"2006","unstructured":"Kleinjung, T.: On polynomial selection for the general number field sieve. Math. Comp.\u00a075, 2037\u20132047 (2006)","journal-title":"Math. Comp."},{"key":"18_CR16","unstructured":"Kleinjung, T.: Polynomial selection. Presented at the CADO Workshop on Integer Factorization (2008), \n                    \n                      http:\/\/cado.gforge.inria.fr\/workshop\/slides\/kleinjung.pdf"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Lenstra, A.K.: Computational methods in public key cryptology. In: Coding theory and cryptology. Lecture Notes Series, pp. 175\u2013238. Institute for Mathematical Sciences, National University of Singapore (2002)","DOI":"10.1142\/9789812388841_0005"},{"key":"18_CR18","first-page":"673","volume-title":"Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity","author":"A.K. Lenstra","year":"1990","unstructured":"Lenstra, A.K., Lenstra Jr., H.W.: Algorithms in number theory. In: Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity, pp. 673\u2013716. Elsevier, Amsterdam (1990)"},{"key":"18_CR19","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 Jr., H.W.: The Development of the Number Field Sieve. LNM, vol.\u00a01554. Springer, Heidelberg (1993)"},{"issue":"203","key":"18_CR20","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1090\/S0025-5718-1993-1182953-4","volume":"61","author":"A.K. Lenstra","year":"1993","unstructured":"Lenstra, A.K., Lenstra Jr., H.W., Manasse, M.S., Pollard, J.M.: The factorization of the ninth Fermat number. Math. of Comp.\u00a061(203), 319\u2013349 (1993)","journal-title":"Math. of Comp."},{"key":"18_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/978-3-540-40061-5_4","volume-title":"Advances in Cryptology - ASIACRYPT 2003","author":"A.K. Lenstra","year":"2003","unstructured":"Lenstra, A.K., Tromer, E., Shamir, A., Kortsmit, W., Dodson, B., Hughes, J., Leyland, P.C.: Factoring estimates for a 1024-bit RSA modulus. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol.\u00a02894, pp. 55\u201374. Springer, Heidelberg (2003)"},{"key":"18_CR22","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1109\/TIT.1969.1054260","volume":"15","author":"J. Massey","year":"1969","unstructured":"Massey, J.: Shift-register synthesis and BCH decoding. IEEE Trans Information Theory\u00a015, 122\u2013127 (1969)","journal-title":"IEEE Trans Information Theory"},{"key":"18_CR23","unstructured":"Montgomery, P.: Square roots of products of algebraic numbers, \n                    \n                      http:\/\/ftp.cwi.nl\/pub\/pmontgom\/sqrt.ps.gz"},{"key":"18_CR24","unstructured":"Montgomery, P., Murphy, B.: Improved polynomial selection for the number field sieve. Technical report, the Fields institute, Toronto, Ontario, Canada (June 1999)"},{"issue":"129","key":"18_CR25","first-page":"183","volume":"29","author":"M.A. Morrison","year":"1975","unstructured":"Morrison, M.A., Brillhart, J.: A method of factoring and the factorization of F\n                  7. Math. of Comp.\u00a029(129), 183\u2013205 (1975)","journal-title":"Math. of Comp."},{"key":"18_CR26","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 polynominals. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol.\u00a01423, pp. 137\u2013150. Springer, Heidelberg (1998)"},{"key":"18_CR27","unstructured":"National Institute of Standards and Technology. Discussion paper: the transitioning of cryptographic algorithms and key sizes, \n                    \n                      http:\/\/csrc.nist.gov\/groups\/ST\/key_mgmt\/documents\/Transitioning_CryptoAlgos_070209.pdf"},{"key":"18_CR28","unstructured":"National Institute of Standards and Technology. Special publication 800-57: Recommendation for key management part 1: General (revised), \n                    \n                      http:\/\/csrc.nist.gov\/publications\/nistpubs\/800-57\/sp800-57-Part1-revised2_Mar08-2007.pdf"},{"key":"18_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BFb0054859","volume-title":"Algorithmic Number Theory","author":"P.Q. Nguyen","year":"1998","unstructured":"Nguyen, P.Q.: A Montgomery-like square root for the number field sieve. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol.\u00a01423, pp. 151\u2013168. Springer, Heidelberg (1998)"},{"key":"18_CR30","doi-asserted-by":"crossref","unstructured":"Pollard, J.M.: The lattice sieve. In: [19], pp. 43\u201349","DOI":"10.1007\/BFb0091538"},{"key":"18_CR31","unstructured":"Pomerance, C.: Analysis and comparison of some integer factoring algorithms. In: Lenstra Jr., H.W., Tijdeman, R. (eds.) Computational Methods in Number Theory, Math. Centrum Tract, Amsterdam, vol.\u00a0154, pp. 89\u2013139 (1982)"},{"key":"18_CR32","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":"18_CR33","unstructured":"Pomerance, C.: A tale of two sieves (1996), \n                    \n                      http:\/\/www.ams.org\/notices\/199612\/pomerance.pdf"},{"key":"18_CR34","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. Communications of the ACM\u00a021, 120\u2013126 (1978)","journal-title":"Communications of the ACM"},{"key":"18_CR35","unstructured":"RSA the security division of EMC. The RSA challenge numbers. formerly on \n                    \n                      http:\/\/www.rsa.com\/rsalabs\/node.asp?id=2093\n                    \n                    \n                  , now on \n                    \n                      http:\/\/en.wikipedia.org\/wiki\/RSA_numbers"},{"key":"18_CR36","unstructured":"RSA the security division of EMC. The RSA factoring challenge FAQ, \n                    \n                      http:\/\/www.rsa.com\/rsalabs\/node.asp?id=2094"},{"key":"18_CR37","unstructured":"Tarantino, Q.: That\u2019s a bingo! \n                    \n                      http:\/\/www.youtube.com\/watch?v=WtHTc8wIo4Q\n                    \n                    \n                  , \n                    \n                      http:\/\/www.imdb.com\/title\/tt0361748\/quotes"},{"issue":"5","key":"18_CR38","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(5), 757\u2013775 (2002)","journal-title":"Journal of Symbolic Computation"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14623-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T20:13:36Z","timestamp":1552853616000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14623-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642146220","9783642146237"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14623-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}