{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T12:14:30Z","timestamp":1777896870200,"version":"3.51.4"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2000,3,1]],"date-time":"2000-03-01T00:00:00Z","timestamp":951868800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,3,1]],"date-time":"2000-03-01T00:00:00Z","timestamp":951868800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Designs, Codes and Cryptography"],"published-print":{"date-parts":[[2000,3]]},"DOI":"10.1023\/a:1008397921377","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T09:41:38Z","timestamp":1040550098000},"page":"101-128","source":"Crossref","is-referenced-by-count":53,"title":["Integer Factoring"],"prefix":"10.1007","volume":"19","author":[{"given":"Arjen K.","family":"Lenstra","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"253936_CR1","doi-asserted-by":"crossref","unstructured":"L. M. Adleman, Factoring numbers using singular integers, Proc. 23rd Annual ACM Symp. on Theory of Computing (STOC), New Orleans, (May 6\u20138, 1991) pp. 64\u201371.","DOI":"10.1145\/103418.103432"},{"key":"253936_CR2","doi-asserted-by":"crossref","first-page":"703","DOI":"10.2307\/2118576","volume":"140","author":"W. R. Alford","year":"1994","unstructured":"W. R. Alford, A. Granville, and C. Pomerance, There are infinitely many Carmichael numbers, Ann. of Math, Vol. 140 (1994) pp. 703\u2013722.","journal-title":"Ann. of Math"},{"key":"253936_CR3","doi-asserted-by":"crossref","unstructured":"W. R. Alford, A. Granville, and C. Pomerance, On the difficulty of finding reliable witnesses, ANTS'94, Lecture Notes in Comput. Sci., 877 (1994) pp. 1\u201316.","DOI":"10.1007\/3-540-58691-1_36"},{"key":"253936_CR4","doi-asserted-by":"crossref","unstructured":"D. Atkins, M. Graff, A. K. Lenstra, and P. C. Leyland, The magic words are squeamish ossifrage, Advances in Cryptology, Asiacrypt'94, Lecture Notes in Comput. Sci., 917 (1995) pp. 265\u2013277.","DOI":"10.1007\/BFb0000440"},{"key":"253936_CR5","unstructured":"D. J. Bernstein, The multiple-lattice number field sieve, Chapter 3 of Ph.D. thesis; ftp:\/\/koobera.math.uic.edu\/pub\/papers\/mlnfs.dvi."},{"key":"253936_CR6","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/978-94-017-1108-1_9","volume-title":"Computational Algebra and Number Theory","author":"W. Bosma","year":"1995","unstructured":"W. Bosma and A. K. Lenstra, An implementation of the elliptic curve integer factorization method, Computational Algebra and Number Theory (W. Bosma and A. van der Poorten, eds.), Kluwer Academic Publishers, Dordrecht, Boston, London (1995) pp. 119\u2013136."},{"key":"253936_CR7","unstructured":"R. P. Brent, Factorization of the tenth and eleventh Fermat Numbers, manuscript (1996)."},{"key":"253936_CR8","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 and J. M. Pollard, Factorization of the eighth Fermat number, Math. Comp., Vol. 36 (1981) pp. 627\u2013630.","journal-title":"Math. Comp."},{"key":"253936_CR9","doi-asserted-by":"crossref","unstructured":"J. Buchmann, J. Loho, and J. Zayer, An implementation of the general number field sieve, Advances in Cryptology, Crypto '93, Lecture Notes in Comput. Sci, 773 (1994) pp. 159\u2013165.","DOI":"10.1007\/3-540-48329-2_14"},{"key":"253936_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0022-314X(83)90002-1","volume":"17","author":"E. R. Canfield","year":"1983","unstructured":"E. R. Canfield, P. Erd\u00f6s, and C. Pomerance, On a problem of Oppenheim concerning \"Factorisatio Numerorum,\" J. Number Theory, Vol. 17 (1983) pp. 1\u201328.","journal-title":"J. Number Theory"},{"key":"253936_CR11","volume-title":"Graduate Texts in Mathematics, Vol. 138","author":"H. Cohen","year":"1993","unstructured":"H. Cohen, A course in computational number theory, Graduate Texts in Mathematics, Vol. 138, Springer-Verlag, Berlin (1993)."},{"key":"253936_CR12","unstructured":"S. Contini and A. K. Lenstra, Implementations of blocked Lanczos and Wiedemann algorithms, manuscript."},{"key":"253936_CR13","doi-asserted-by":"crossref","unstructured":"J. Cowie, B. Dodson, R. M. Elkenbracht-Huizing, A. K. Lenstra, P. L. Montgomery, and J. Zayer, A World Wide Number Field Sieve factoring record: on to 512 bits, Advances in Cryptography, Asiacrypt '96, Lecture Notes in Computer Science, 1163 (1996) pp. 382\u2013394.","DOI":"10.1007\/BFb0034863"},{"key":"253936_CR14","series-title":"Tech. Report SAND 83\u20131346","volume-title":"Factorization using the quadratic sieve algorithm","author":"J. A. Davis","year":"1983","unstructured":"J. A. Davis and D. B. Holdridge, Factorization using the quadratic sieve algorithm, Tech. Report SAND 83\u20131346, Sandia National Laboratories, Albuquerque, NM (1983)."},{"key":"253936_CR15","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/S1385-7258(66)50029-4","volume":"38","author":"N. G. de Bruijn","year":"1966","unstructured":"N. G. de Bruijn, On the number of positive integers \u2264 x and free of prime factors > y, II, Indag. Math., Vol. 38 (1966) pp. 239\u2013247.","journal-title":"Indag. Math."},{"key":"253936_CR16","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1090\/S0025-5718-96-00674-6","volume":"65","author":"M. Deleglise","year":"1996","unstructured":"M. Deleglise and J. Rivat, Computing \u03c0(x): the Meissel, Lehmer, Lagarias, Miller, Odlyzko method, Math. Comp., Vol. 65 (1996) pp. 235\u2013245.","journal-title":"Math. Comp."},{"key":"253936_CR17","doi-asserted-by":"crossref","unstructured":"T. Denny, B. Dodson, A. K. Lenstra, and M. S. Manasse, On the factorization of RSA-120, Advances in Cryptology, Crypto '93, Lecture Notes in Comput. Sci., 773 (1994) pp. 166\u2013174.","DOI":"10.1007\/3-540-48329-2_15"},{"key":"253936_CR18","doi-asserted-by":"crossref","unstructured":"B. Dodson and A. K. Lenstra, NFS with four large primes: an explosive experiment, Advances in Cryptology, Crypto '95, Lecture Notes in Comput. Sci., 963 (1995) pp. 372\u2013385.","DOI":"10.1007\/3-540-44750-4_30"},{"key":"253936_CR19","unstructured":"R. M. Elkenbracht-Huizing, An implementation of the number field sieve, Technical Report NM-R9511, Centrum voor Wiskunde en Informatica, Amsterdam, 1995; to appear in Experimental Mathematics."},{"key":"253936_CR20","doi-asserted-by":"crossref","unstructured":"R. M. Elkenbracht-Huizing, A multiple polynomial general number field sieve, Preproceedings ANTS II (H. Cohen, ed.), Universit\u00b4e de Bordeaux (1996) pp. 101\u2013116.","DOI":"10.1007\/3-540-61581-4_45"},{"key":"253936_CR21","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) pp. 120\u2013124.","DOI":"10.1038\/scientificamerican0877-120"},{"key":"253936_CR22","unstructured":"J. Gillogly, A. K. Lenstra, P. C. Leyland, and A. Muffett, An unnoticed factoring attack on a PGP key, presented at Crypto '95 rump session."},{"key":"253936_CR23","doi-asserted-by":"crossref","unstructured":"R. Golliver, A. K. Lenstra, and K. McCurley, Lattice sieving and trial division, ANTS'94, Lecture Notes in Comput. Sci., 877 (1994) pp. 18\u201327.","DOI":"10.1007\/3-540-58691-1_38"},{"key":"253936_CR24","volume-title":"An Introduction to the Theory of Numbers","author":"G. H. Hardy","year":"1979","unstructured":"G. H. Hardy and W. M. Wright, An Introduction to the Theory of Numbers, 5th ed., Oxford University Press, Oxford (1979).","edition":"5th ed."},{"key":"253936_CR25","volume-title":"Seminumerical Algorithms","author":"D. E. Knuth","year":"1981","unstructured":"D. E. Knuth, Art of computer programming, volume 2, Seminumerical Algorithms, 2nd ed., Addison-Wesley, Reading, Massachusetts (1981).","edition":"2nd ed."},{"key":"253936_CR26","first-page":"195","volume-title":"Theorie de Nombres, II","author":"M. Kra\u00eftchik","year":"1926","unstructured":"M. Kra\u00eftchik, Theorie de Nombres, II, Gauthiers-Villars, Paris (1926) pp. 195\u2013208."},{"key":"253936_CR27","first-page":"537","volume":"44","author":"J. C. Lagarias","year":"1985","unstructured":"J. C. Lagarias, V. S. Miller, and A. M. Odlyzko, Computing \u03c0(x): The Meissel-Lehmer Method, Math. Comp., Vol. 44 (1985) pp. 537\u2013560.","journal-title":"Math. Comp."},{"key":"253936_CR28","doi-asserted-by":"crossref","unstructured":"B. A. LaMacchia and A. M. Odlyzko, Solving large sparse linear systems over finite fields, Advances in Cryptology, Crypto'90, Lecture Notes in Comput. Sci., 537 (1991) pp. 109\u2013133.","DOI":"10.1007\/3-540-38424-3_8"},{"key":"253936_CR29","volume-title":"Handbook of Theoretical Computer Science, Volume A, Algorithms and Complexity","author":"A. K. Lenstra","year":"1990","unstructured":"A. K. Lenstra and H. W. Lenstra, Jr., Algorithms in number theory, Chapter 12 in Handbook of Theoretical Computer Science, Volume A, Algorithms and Complexity (J. van Leeuwen, ed.), Elsevier, Amsterdam (1990)."},{"key":"253936_CR30","series-title":"Lecture Notes in Math.","doi-asserted-by":"crossref","first-page":"1554","DOI":"10.1007\/BFb0091534","volume-title":"The development of the number field sieve","author":"A. K. Lenstra","year":"1993","unstructured":"A. K. Lenstra and H. W. Lenstra, Jr., The development of the number field sieve, Lecture Notes in Math., Springer-Verlag, Berlin, 1554 (1993)."},{"key":"253936_CR31","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, and J. M. Pollard, The factorization of the ninth Fermat number, Math. Comp., Vol. 61 (1993) pp. 319\u2013349.","journal-title":"Math. Comp."},{"key":"253936_CR32","doi-asserted-by":"crossref","unstructured":"A. K. Lenstra and M. S. Manasse, Factoring by electronic mail, Advances in Cryptology, Eurocrypt '89, Lecture Notes in Comput. Sci., 434 (1990) pp. 355\u2013371.","DOI":"10.1007\/3-540-46885-4_35"},{"key":"#cr-split#-253936_CR33.1","doi-asserted-by":"crossref","unstructured":"A. K. Lenstra and M. S. Manasse, Factoring with two large primes, Advances in Cryptology, Eurocrypt '90, Lecture Notes in Comput. Sci., 473 (1990) pp. 72-82","DOI":"10.1007\/3-540-46877-3_7"},{"key":"#cr-split#-253936_CR33.2","doi-asserted-by":"crossref","unstructured":"Math. Comp., Vol. 63 (1994) pp. 785-798.","DOI":"10.1090\/S0025-5718-1994-1250773-9"},{"key":"253936_CR34","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, Vol. 126 (1987) pp. 649\u2013673.","journal-title":"Ann. of Math"},{"key":"253936_CR35","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., and C. Pomerance, A rigorous time bound for factoring integers, J. Amer. Math. Soc., Vol. 5 (1992) pp. 483\u2013516.","journal-title":"J. Amer. Math. Soc."},{"key":"253936_CR36","unstructured":"H. W. Lenstra, Jr. and R. Tijdeman (eds.), Computational methods in number theory, Math. Centre Tracts, Vol. 154\/155, Mathematisch Centrum, Amsterdam (1983)."},{"key":"253936_CR37","unstructured":"P. C. Leyland, Multiple polynomial quadratic sieve, sans math, ftp:\/\/ftp.ox.ac.uk\/pub\/math\/rsa129\/ mpqs sans math.Z (1994)."},{"key":"253936_CR38","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0304-3975(80)90007-9","volume":"11","author":"L. Monier","year":"1980","unstructured":"L. Monier, Evaluation and comparison of two efficient probabilistic primality testing algorithms, Theor. Comp. Science, Vol. 11 (1980) pp. 97\u2013108.","journal-title":"Theor. Comp. Science"},{"key":"253936_CR39","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1090\/S0025-5718-1987-0866113-7","volume":"48","author":"P. L. Montgomery","year":"1987","unstructured":"P. L. Montgomery, Speeding the Pollard and elliptic curve methods of factorization, Math. Comp., Vol. 48 (1987) pp. 243\u2013264.","journal-title":"Math. Comp."},{"key":"253936_CR40","doi-asserted-by":"crossref","unstructured":"P. L. Montgomery, Square roots of products of algebraic numbers, Proceedings of Symposia in Applied Mathematics (Walter Gautschi, ed.), Mathematics of Computation 1943\u20131993, Vancouver (1993).","DOI":"10.1090\/psapm\/048\/1314892"},{"key":"253936_CR41","doi-asserted-by":"crossref","unstructured":"P. L. Montgomery, A block Lanczos algorithm for finding dependencies over GF(2), Advances in Cryptology, Eurocrypt'95, Lecture Notes in Comput. Sci., 921 (1995) pp. 106\u2013120.","DOI":"10.1007\/3-540-49264-X_9"},{"key":"253936_CR42","first-page":"183","volume":"29","author":"M. A. Morrison","year":"1975","unstructured":"M. A. Morrison and J. Brillhart, A method of factoring and the factorization of F\n7, Math. Comp., Vol. 29 (1975) pp. 183\u2013205.","journal-title":"Math. Comp."},{"key":"253936_CR43","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. Cambridge Philos. Soc., Vol. 76 (1974) pp. 521\u2013528.","journal-title":"Proc. Cambridge Philos. Soc."},{"key":"253936_CR44","doi-asserted-by":"crossref","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, Vol. 15 (1975) pp. 331\u2013334.","journal-title":"BIT"},{"key":"253936_CR45","series-title":"Lecture Notes in Math.","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BFb0091538","volume-title":"The lattice sieve","author":"J. M. Pollard","year":"1993","unstructured":"J. M. Pollard, The lattice sieve, Lecture Notes in Math., Springer-Verlag, Berlin, 1554 (1993) pp. 43\u201349."},{"key":"253936_CR46","first-page":"89","volume-title":"Math. Centre Tracts, Vol. 154\/155","author":"C. Pomerance","year":"1983","unstructured":"C. Pomerance, Analysis and comparison of some integer factoring algorithms, Computational methods in number theory, Math. Centre Tracts, Vol. 154\/155, Mathematisch Centrum, Amsterdam (1983) pp. 89\u2013139."},{"key":"253936_CR47","unstructured":"C. Pomerance, Private communication (March 1996)."},{"key":"253936_CR48","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1080\/10586458.1992.10504250","volume":"1","author":"C. Pomerance","year":"1992","unstructured":"C. Pomerance and J. W. Smith, Reduction of huge, sparse matrices over finite fields via created catastrophes, Experiment. Math., Vol. 1 (1992) pp. 89\u201394.","journal-title":"Experiment. Math."},{"key":"253936_CR49","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/0022-314X(80)90084-0","volume":"12","author":"M. O. Rabin","year":"1980","unstructured":"M. O. Rabin, Probabilistic algorithms for primality testing, J. Number Theory, Vol. 12 (1980) pp. 128\u2013138.","journal-title":"J. Number Theory"},{"key":"253936_CR50","volume-title":"Progr. Math., Vol. 57","author":"H. Riesel","year":"1985","unstructured":"H. Riesel, Prime numbers and computer methods for factorization. Progr. Math., Vol. 57, Birkh\u00e4user, Boston (1985)."},{"key":"253936_CR51","doi-asserted-by":"crossref","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, Vol. 21 (1978) pp. 120\u2013126.","journal-title":"Comm. ACM"},{"key":"253936_CR52","first-page":"235","volume-title":"Math. Centre Tracts, Vol. 154\/155","author":"R. Schoof","year":"1983","unstructured":"R. Schoof, Quadratic fields and factorization, Computational methods in number theory, Math. Centre Tracts, Vol. 154\/155, Mathematisch Centrum, Amsterdam (1983) pp. 235\u2013286."},{"key":"253936_CR53","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1090\/pspum\/020\/0316385","volume":"XX","author":"D. Shanks","year":"1971","unstructured":"D. Shanks, Class number, a theory of factorization, and genera, Proc. Symp. Pure Math., Vol. XX, AMS (1971) pp. 415\u2013440.","journal-title":"Proc. Symp. Pure Math."},{"key":"253936_CR54","first-page":"327","volume":"84","author":"R. D. Silverman","year":"1987","unstructured":"R. D. Silverman, The multiple polynomial quadratic sieve, Math. Comp., Vol. 84 (1987) pp. 327\u2013339.","journal-title":"Math. Comp."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008397921377.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008397921377\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008397921377.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T03:46:48Z","timestamp":1753760808000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008397921377"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,3]]},"references-count":55,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2000,3]]}},"alternative-id":["253936"],"URL":"https:\/\/doi.org\/10.1023\/a:1008397921377","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,3]]}}}