{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:15:10Z","timestamp":1725455710730},"publisher-location":"Berlin, Heidelberg","reference-count":52,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584490"},{"type":"electronic","value":"9783540487999"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/bfb0020422","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:21:02Z","timestamp":1131862862000},"page":"28-38","source":"Crossref","is-referenced-by-count":2,"title":["Factoring"],"prefix":"10.1007","author":[{"given":"Arjen K.","family":"Lenstra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"L. M. Adleman, Factoring numbers using singular integers, proc 23rd Annual ACM Symposium on Theory of Computing (STOC) (1991) 64\u201371","DOI":"10.1145\/103418.103432"},{"key":"3_CR2","unstructured":"W. R. Alford, C. Pomerance, Implementing the self initializing quadratic sieve on a distributed network, manuscript, 1994"},{"key":"3_CR3","unstructured":"D. Atkins, M. Graff, A. K. Lenstra, P. C. Leyland, THE MAGIC WORDS ARE SQUEAMISH OSSIFRAGE (in preparation)"},{"key":"3_CR4","series-title":"Lecture Notes in Math. 1554","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/BFb0091541","volume-title":"The development of the number field sieve","author":"D. J. Bernstein","year":"1993","unstructured":"D. J. Bernstein, A. K. Lenstra, A general number field sieve implementation, 103\u2013126 in: [26]"},{"key":"3_CR5","first-page":"73","volume":"10","author":"R. P. Brent","year":"1989","unstructured":"R. P. Brent, Factorization of the eleventh Fermat number (preliminary report), Abstracts Amer. Math. Soc. 10 (1989) 73","journal-title":"Abstracts Amer. Math. Soc."},{"key":"3_CR6","series-title":"Lecture Note Series 154","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1017\/CBO9781107325838.004","volume-title":"Number theory and cryptography, London Math. Soc.","author":"R. P. Brent","year":"1990","unstructured":"R. P. Brent, Parallel algorithms for integer factorisation, pp. 26\u201337 in: J. H. Loxton (ed.), Number theory and cryptography, London Math. Soc. Lecture Note Series 154, Cambridge University Press, Cambridge, 1990"},{"key":"3_CR7","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1090\/S0025-5718-1981-0606520-5","volume":"36","author":"R. P. Brent","year":"1981","unstructured":"R. P. Brent, J. M. Pollard, Factorization of the eighth Fermat number, Math. Comp. 36 (1981) 627\u2013630","journal-title":"Math. Comp."},{"key":"3_CR8","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/3-540-48329-2_14","volume":"773","author":"J. Buchmann","year":"1994","unstructured":"J. Buchmann, J. Loho, J. Zayer, An implementation of the general number field sieve, Advances in Cryptology, Crypto '93, Lecture Notes in Comput. Sci. 773 (1994) 159\u2013165.","journal-title":"Lecture Notes in Comput. Sci."},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/BF00154339","volume":"1","author":"T. R. Caron","year":"1988","unstructured":"T. R. Caron, R. D. Silverman, Parallel implementation of the quadratic sieve, The Journal of Supercomputing 1 (1988) 273\u2013290","journal-title":"The Journal of Supercomputing"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0024-3795(93)90235-G","volume":"192","author":"S. Coppersmith","year":"1993","unstructured":"S. Coppersmith, Solving linear equations over GF(2): block Lanczos algorithm, Linear algebras and its applications 192 (1993) 33\u201360","journal-title":"Linear algebras and its applications"},{"key":"3_CR11","first-page":"333","volume":"62","author":"S. Coppersmith","year":"1994","unstructured":"S. Coppersmith, Solving homogeneous linear equations over GF(2) via block Wiedemann algorithm, Math. Comp. 62 (1994) 333\u2013350","journal-title":"Math. Comp."},{"key":"3_CR12","volume-title":"Tech. Report SAND 83-1346","author":"J. A. Davis","year":"1983","unstructured":"J. A. Davis, D. B. Holdridge, Factorization using the quadratic sieve algorithm, Tech. Report SAND 83-1346, Sandia National Laboratories, Albuquerque, NM, 1983"},{"key":"3_CR13","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/3-540-48329-2_15","volume":"773","author":"T. Denny","year":"1994","unstructured":"T. Denny, B. Dodson, A. K. Lenstra, M. S. Manasse, On the factorization of RSA-120, Advances in Cryptology, Crypto '93, Lecture Notes in Comput. Sci. 773 (1994) 166\u2013174","journal-title":"Lecture Notes in Comput. Sci."},{"key":"3_CR14","unstructured":"A. D\u00edaz, M. Hitz, E. Kaltofen, A. Lobo, T. Valente, Process scheduling in DCS and the large sparse linear systems challenge, J. Symbolic Computation (submitted)"},{"key":"3_CR15","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/3-540-48285-7_3","volume":"765","author":"B. Dixon","year":"1994","unstructured":"B. Dixon, A. K. Lenstra, Factoring integers using SIMD sieves, Advances in Cryptology, Eurocrypt '93, Lecture Notes in Comput. Sci. 765 (1994) 28\u201339","journal-title":"Lecture Notes in Comput. Sci."},{"key":"3_CR16","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1090\/S0025-5718-1981-0595059-1","volume":"36","author":"J. D. Dixon","year":"1981","unstructured":"J. D. Dixon, Asymptotically fast factorization of integers, Math. Comp. 36 (1981) 255\u2013260","journal-title":"Math. Comp."},{"key":"3_CR17","unstructured":"B. Dodson, A. K. Lenstra, NFS with four large primes: an explosive experiment (in preparation)"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"M. Gardner, Mathematical games, A new kind of cipher that would take millions of years to break, Scientific American, August 1977, 120\u2013124","DOI":"10.1038\/scientificamerican0877-120"},{"key":"3_CR19","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1090\/S0025-5718-1983-0701639-4","volume":"36","author":"J. L. Gerver","year":"1983","unstructured":"J. L. Gerver, Factoring large numbers with a quadratic sieve, Math. Comp. 36 (1983) 287\u2013294","journal-title":"Math. Comp."},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"R. Golliver, A. K. Lenstra, K. S. McCurley, Lattice sieving and trial division, Algorithmic number theory symposium, proceedings, Cornell, 1994 (to appear)","DOI":"10.1007\/3-540-58691-1_38"},{"key":"3_CR21","first-page":"49","volume":"16","author":"R. K. Guy","year":"1976","unstructured":"R. K. Guy, How to factor a number, Proc. Fifth Manitoba Conf. Numer. Math., Congressus Numerantium 16 (1976) 49\u201389","journal-title":"Proc. Fifth Manitoba Conf. Numer. Math., Congressus Numerantium"},{"key":"3_CR22","volume-title":"An introduction to the theory of numbers","author":"G. H. Hardy","year":"1979","unstructured":"G. H. Hardy, E. M. Wright, An introduction to the theory of numbers, Oxford Univ. Press, Oxford, 5th ed., 1979","edition":"5th ed."},{"key":"3_CR23","unstructured":"E. Kaltofen, Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems, Math. Comp. (to appear)"},{"key":"3_CR24","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BF00123958","volume":"1","author":"B. A. LaMacchia","year":"1991","unstructured":"B. A. LaMacchia, A. M. Odlyzko, Computation of discrete logarithms in prime fields, Designs, Codes and Cryptography 1 (1991) 47\u201362","journal-title":"Designs, Codes and Cryptography"},{"key":"3_CR25","volume-title":"Handbook of theoretical computer science, Volume A, Algorithms and complexity","author":"A. K. Lenstra","year":"1990","unstructured":"A. K. Lenstra, H. W. Lenstra, Jr., Algorithms in number theory, Chapter 12 in: J. van Leeuwen (ed.), Handbook of theoretical computer science, Volume A, Algorithms and complexity, Elsevier, Amsterdam, 1990"},{"key":"3_CR26","series-title":"Lecture Notes in Math. 1554","volume-title":"The development of the number field sieve","year":"1993","unstructured":"A. K. Lenstra, H. W. Lenstra, Jr. (eds), The development of the number field sieve, Lecture Notes in Math. 1554, Springer-Verlag, Berlin, 1993"},{"key":"3_CR27","series-title":"Lecture Notes in Math. 1554","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BFb0091537","volume-title":"The development of the number field sieve","author":"A. K. Lenstra","year":"1993","unstructured":"A. K. Lenstra, H. W. Lenstra, Jr., M. S. Manasse, J. M. Pollard, The number field sieve, 11\u201342 in: [26]"},{"key":"3_CR28","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1090\/S0025-5718-1993-1182953-4","volume":"61","author":"A. K. Lenstra","year":"1993","unstructured":"A. K. Lenstra, H. W. Lenstra, Jr., M. S. Manasse, J. M. Pollard, The factorization of the ninth Fermat number, Math. Comp. 61 (1993) 319\u2013349","journal-title":"Math. Comp."},{"key":"3_CR29","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/3-540-46885-4_35","volume":"434","author":"A. K. Lenstra","year":"1990","unstructured":"A. K. Lenstra, M. S. Manasse, Factoring by electronic mail, Advances in Cryptology, Eurocrypt '89, Lecture Notes in Comput. Sci. 434 (1990) 355\u2013371","journal-title":"Lecture Notes in Comput. Sci."},{"key":"3_CR30","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/3-540-46877-3_7","volume":"473","author":"A. K. Lenstra","year":"1990","unstructured":"A. K. Lenstra, M. S. Manasse, Factoring with two large primes, Advances in Cryptology, Eurocrypt '90, Lecture Notes in Comput. Sci., 473 (1990) 72\u201382; Math. Comp. (to appear)","journal-title":"Lecture Notes in Comput. Sci."},{"key":"3_CR31","doi-asserted-by":"crossref","first-page":"649","DOI":"10.2307\/1971363","volume":"126","author":"H. W. Lenstra Jr.","year":"1987","unstructured":"H. W. Lenstra, Jr., Factoring integers with elliptic curves, Ann. of Math. 126 (1987) 649\u2013673","journal-title":"Ann. of Math."},{"key":"3_CR32","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1090\/S0894-0347-1992-1137100-0","volume":"5","author":"H. W. Lenstra Jr.","year":"1992","unstructured":"H. W. Lenstra, Jr., C. Pomerance, A rigorous time bound for factoring integers, J. Amer. Math. Soc. 5 (1992) 483\u2013516","journal-title":"J. Amer. Math. Soc."},{"key":"3_CR33","series-title":"Math. Centre Tracts 154\/155","volume-title":"Computational methods in number theory","year":"1984","unstructured":"H. W. Lenstra, Jr., R. Tijdeman (eds), Computational methods in number theory, Math. Centre Tracts 154\/155, Mathematisch Centrum, Amsterdam, 1984"},{"key":"3_CR34","unstructured":"E. Messmer, Bellcore leads team effort to crack RSA encryption code, Network World, May 2, 1994"},{"key":"3_CR35","unstructured":"P. L. Montgomery, Record number field sieve factorizations, announcement on NmbrThry@VM1.NODAK.EDU, July 12, 1994"},{"key":"3_CR36","doi-asserted-by":"crossref","unstructured":"P. L. Montgomery, A block Lanczos algorithm for finding dependencies over GF(2), Draft manuscript, June 17, 1994","DOI":"10.1007\/3-540-49264-X_9"},{"key":"3_CR37","first-page":"183","volume":"29","author":"M. A. Morrison","year":"1975","unstructured":"M. A. Morrison, J. Brillhart, A method of factoring and the factorization of F 7, Math. Comp. 29 (1975) 183\u2013205","journal-title":"Math. Comp."},{"key":"3_CR38","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1007\/3-540-48071-4_23","volume":"740","author":"R. Peralta","year":"1993","unstructured":"R. Peralta, A quadratic sieve on the n-dimensional hypercube, Advances in Cryptology, Crypto '92, Lecture Notes in Comput. Sci. 740 (1993) 324\u2013332","journal-title":"Lecture Notes in Comput. Sci."},{"key":"3_CR39","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1017\/S0305004100049252","volume":"76","author":"J. M. Pollard","year":"1974","unstructured":"J. M. Pollard, Theorems on factorization and primality testing, Proc. Cambr. Philos. Soc 76 (1974) 521\u2013528","journal-title":"Proc. Cambr. Philos. Soc"},{"key":"3_CR40","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF01933667","volume":"15","author":"J. M. Pollard","year":"1975","unstructured":"J. M. Pollard, A Monte Carlo method for factorization, BIT 15 (1975) 331\u2013334","journal-title":"BIT"},{"key":"3_CR41","series-title":"Lecture Notes in Math. 1554","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1007\/BFb0091536","volume-title":"The development of the number field sieve","author":"J. M. Pollard","year":"1993","unstructured":"J. M. Pollard, Factoring with cubic integers, 4\u201310 in [26]"},{"key":"3_CR42","series-title":"Math. Centre Tracts 154\/155","first-page":"89","volume-title":"Computational methods in number theory","author":"C. Pomerance","year":"1984","unstructured":"C. Pomerance, Analysis and comparison of some integer factoring algorithms, pp. 89\u2013139 in: [33]"},{"key":"3_CR43","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1080\/10586458.1992.10504250","volume":"1","author":"C. Pomerance","year":"1992","unstructured":"C. Pomerance, J. W. Smith, Reduction of huge, sparse matrices over finite fields via created catastrophes, Experiment. Math. 1 (1992) 89\u201394","journal-title":"Experiment. Math."},{"key":"3_CR44","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1137\/0217023","volume":"17","author":"C. Pomerance","year":"1988","unstructured":"C. Pomerance, J. W. Smith, R. Tuler, A pipe-line architecture for factoring large integers with the quadratic sieve algorithm, SIAM J. Comput. 17 (1988) 387\u2013403","journal-title":"SIAM J. Comput."},{"key":"3_CR45","unstructured":"R. L. Rivest, letter to Martin Gardner, 1977"},{"key":"3_CR46","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, L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Comm. ACM 21 (1978) 120\u2013126","journal-title":"Comm. ACM"},{"key":"3_CR47","series-title":"Math. Centre Tracts 154\/155","first-page":"235","volume-title":"Computational methods in number theory","author":"R. J. Schoof","year":"1984","unstructured":"R. J. Schoof, Quadratic fields and factorization, pp 235\u2013286 in: [33]"},{"key":"3_CR48","unstructured":"R. C. Schroeppel, personal communication, May 1994"},{"key":"3_CR49","unstructured":"P. W. Shor, Algorithms for quantum computation: Discrete log and factoring, DIMACS Technical Report 94-37; to appear in Proc. 35th Symposium on Foundations of Computer Science, 1994"},{"key":"3_CR50","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1090\/S0025-5718-1987-0866119-8","volume":"48","author":"R. D. Silverman","year":"1987","unstructured":"R. D. Silverman, The multiple polynomial quadratic sieve, Math. Comp. 48 (1987) 329\u2013339","journal-title":"Math. Comp."},{"key":"3_CR51","unstructured":"J. W. Smith, S. S. Wagstaff, Jr., An extended precision operand computer, Proc. 21st Southeast Region ACM Conf. (1983) 209\u2013216"},{"key":"3_CR52","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/TIT.1986.1057137","volume":"32","author":"D. H. Wiedemann","year":"1986","unstructured":"D. H. Wiedemann, Solving sparse linear equations over finite fields, IEEE Trans. Inform. Theory 32 (1986) 54\u201362","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0020422","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T20:46:31Z","timestamp":1586551591000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0020422"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584490","9783540487999"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/bfb0020422","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}