{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T09:37:12Z","timestamp":1771234632616,"version":"3.50.1"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1993,3,1]],"date-time":"1993-03-01T00:00:00Z","timestamp":730944000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Cryptology"],"published-print":{"date-parts":[[1993,3]]},"DOI":"10.1007\/bf00198464","type":"journal-article","created":{"date-parts":[[2004,8,29]],"date-time":"2004-08-29T02:50:56Z","timestamp":1093747856000},"page":"169-180","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":51,"title":["Modifications to the Number Field Sieve"],"prefix":"10.1007","volume":"6","author":[{"given":"Don","family":"Coppersmith","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF00198464_CR1","doi-asserted-by":"crossref","unstructured":"L. M. Adleman, Factoring numbers using singular integers, Proc. 23rd Annual ACM Symposium on the Theory of Computing, 1991, pp. 64\u201371.","DOI":"10.1145\/103418.103432"},{"key":"BF00198464_CR2","unstructured":"J. P. Buhler, H. W. Lenstra, Jr., and C. Pomerance, Factoring Integers with the Number Field Sieve, Springer-Verlag, Berlin, Lecture Notes in Mathematics, to appear."},{"key":"BF00198464_CR3","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 \u201cFactorisatio Numerorum\u201d, J. Number Theory\n17 (1983), 1\u201328.","journal-title":"J. Number Theory"},{"key":"BF00198464_CR4","series-title":"Research Report RC 17293","volume-title":"Solving Linear Equations over GF(2) II: Block Wiedemann Algorithm","author":"D. Coppersmith","year":"17 October 1991","unstructured":"D. Coppersmith, Solving Linear Equations over GF(2) II: Block Wiedemann Algorithm, Research Report RC 17293, IBM T. J. Watson Research Center, Yorktown Heights, NY, 17 October 1991. To appear in Math. Comput."},{"key":"BF00198464_CR5","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":"N. G. de Bruijn, On the number of positive integers \u2264x and free of prime factors >y, II, Nederl. Akad. Wetersch. Indag. Math.\n38 (1966), 239\u2013247.","journal-title":"Nederl. Akad. Wetersch. Indag. Math."},{"key":"BF00198464_CR6","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.\n126 (1987), 649\u2013673.","journal-title":"Ann. of Math."},{"key":"BF00198464_CR7","doi-asserted-by":"crossref","unstructured":"A. K. Lenstra, H. W. Lenstra, Jr., M. S. Manasse, and J. M. Pollard, The number field sieve, Proc 22nd Annual ACM Symposium on the Theory of Computing, 1990, pp. 564\u2013572.","DOI":"10.1145\/100216.100295"},{"key":"BF00198464_CR8","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/B978-0-12-386870-1.50014-9","volume-title":"Discrete Algorithms and Complexity","author":"C. Pomerance","year":"1987","unstructured":"C. Pomerance, Fast, rigorous factorization and discrete logarithm algorithms, in: D. S. Johnson, T. Nishizeki, A Nozaki, and H. S. Wilf (eds), Discrete Algorithms and Complexity, Academic Press, Orlando, FL, 1987, pp. 119\u2013143."},{"key":"BF00198464_CR9","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0196-6774(82)90012-8","volume":"3","author":"C. P. Schnorr","year":"1982","unstructured":"C. P. Schnorr, Refined analysis and improvements on some factoring algorithms, J. Algorithms\n3 (1982), 101\u2013127.","journal-title":"J. Algorithms"},{"key":"BF00198464_CR10","doi-asserted-by":"crossref","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\n32 (1986), 54\u201362.","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00198464.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00198464\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00198464","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00198464.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:28:07Z","timestamp":1586334487000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00198464"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,3]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,3]]}},"alternative-id":["BF00198464"],"URL":"https:\/\/doi.org\/10.1007\/bf00198464","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,3]]},"assertion":[{"value":"19 November 1990","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 November 1992","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}