{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:22:30Z","timestamp":1753885350909},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540593393"},{"type":"electronic","value":"9783540492368"}],"license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"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":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0000440","type":"book-chapter","created":{"date-parts":[[2005,10,7]],"date-time":"2005-10-07T11:27:29Z","timestamp":1128684449000},"page":"261-277","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["The magic words are squeamish ossifrage"],"prefix":"10.1007","author":[{"given":"Derek","family":"Atkins","sequence":"first","affiliation":[]},{"given":"Michael","family":"Graff","sequence":"additional","affiliation":[]},{"given":"Arjen K.","family":"Lenstra","sequence":"additional","affiliation":[]},{"given":"Paul C.","family":"Leyland","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,9,8]]},"reference":[{"key":"21_CR1","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: [13].."},{"key":"21_CR2","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 RSA120, Advances in Cryptology, Crypto '93, Lecture Notes in Comput. Sci. 773 (1994) 166\u2013174.","journal-title":"Advances in Cryptology, Crypto '93, Lecture Notes in Comput. Sci."},{"key":"21_CR3","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":"21_CR4","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":"Advances in Cryptology, Eurocrypt '93, Lecture Notes in Comput. Sci."},{"key":"21_CR5","unstructured":"B. Dodson, A. K. Lenstra, NFS with four large primes: an explosive experiment, in preparation."},{"key":"21_CR6","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":"21_CR7","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1007\/3-540-58691-1_38","volume":"877","author":"R. Golliver","year":"1994","unstructured":"R. Golliver, A. K. Lenstra, K. S. McCurley, Lattice sieving and trial division, Algorithmic number theory symposium, Lecture Notes in Comput. Sci. 877 (1994) 18\u201327.","journal-title":"Algorithmic number theory symposium, Lecture Notes in Comput. Sci."},{"key":"21_CR8","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":"21_CR9","volume-title":"The art of computer programming, volume 2, Seminumerical algorithms","author":"D. E. Knuth","year":"1981","unstructured":"D. E. Knuth, The art of computer programming, volume 2, Seminumerical algorithms, second edition, Addison-Wesley, Reading, Massachusetts, 1981.","edition":"second edition"},{"key":"21_CR10","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":"21_CR11","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1007\/BFb0023840","volume":"583","author":"A. K. Lenstra","year":"1992","unstructured":"A. K. Lenstra, Massively parallel computing and factoring, Proceedings Latin'92, Lecture Notes in Comput. Sci. 583 (1992) 344\u2013355.","journal-title":"Proceedings Latin'92, Lecture Notes in Comput. Sci."},{"key":"21_CR12","series-title":"Algorithms and complexity","volume-title":"Handbook of theoretical computer science, Volume A","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":"21_CR13","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":"21_CR14","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":"21_CR15","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":"Advances in Cryptology, Eurocrypt '89, Lecture Notes in Comput. Sci."},{"key":"21_CR16","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":"Advances in Cryptology, Eurocrypt '90, Lecture Notes in Comput. Sci."},{"key":"21_CR17","unstructured":"U. M. Maurer, Fast generation of prime numbers and secure public-key cryptographic parameters, Journal of Cryptology, to appear."},{"key":"21_CR18","series-title":"Math. Centre Tracts 154\/155","first-page":"89","volume-title":"Computational methods in number theory","author":"C. Pomerance","year":"1983","unstructured":"C. Pomerance, Analysis and comparison of some integer factoring algorithms, pp. 89\u2013139 in: H. W. Lenstra, Jr., R. Tijdeman (eds), Computational methods in number theory, Math. Centre Tracts 154\/155, Mathematisch Centrum, Amsterdam, 1983."},{"key":"21_CR19","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":"21_CR20","unstructured":"R. L. Rivest, letter to Martin Gardner, 1977."},{"key":"21_CR21","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, L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Comm. ACM 21 (1978) 120\u2013126.","journal-title":"Comm. ACM"},{"key":"21_CR22","unstructured":"R. C. Schroeppel, personal communication, May 1994."},{"key":"21_CR23","unstructured":"A. Shamir, personal communication, April 1994."},{"key":"21_CR24","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."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 ASIACRYPT'94"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0000440","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T21:06:34Z","timestamp":1578517594000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0000440"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540593393","9783540492368"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/bfb0000440","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]},"assertion":[{"value":"8 September 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}