{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T21:28:38Z","timestamp":1760131718392},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[1995,9,1]],"date-time":"1995-09-01T00:00:00Z","timestamp":809913600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Complexity"],"published-print":{"date-parts":[[1995,9]]},"DOI":"10.1007\/bf01206320","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T14:33:05Z","timestamp":1109255585000},"page":"237-247","source":"Crossref","is-referenced-by-count":9,"title":["On the oracle complexity of factoring integers"],"prefix":"10.1007","volume":"5","author":[{"given":"Ueli M.","family":"Maurer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","series-title":"Lecture Notes in Computer Science","first-page":"263","volume-title":"Advances in Cryptology-Asiacrypt '94","author":"D. Atkins","year":"1994","unstructured":"D. Atkins, M. Graff, A. K. Lenstra, andP. C. Leyland, The magic words are squeamish ossifrage. InAdvances in Cryptology-Asiacrypt '94 Lecture Notes in Computer Science917, Springer-Verlag (Berlin), 1994, 263?277."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1090\/S0025-5718-1989-0947467-1","volume":"52","author":"E. Bach","year":"1989","unstructured":"E. Bach andJ. Shallit, Factoring with cyclotomic polynomials.Mathematics of Computation 52 (1989), 201?219.","journal-title":"Mathematics of Computation"},{"key":"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, andC. Pomerance, On a problem of Oppenheim concerning ?Factorisatio Numerorum,?.Journal of Number Theory 17 (1983), 1?28.","journal-title":"Journal of Number Theory"},{"issue":"1","key":"CR4","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/0885-064X(89)90015-0","volume":"5","author":"B. Chor","year":"1989","unstructured":"B. Chor andO. Goldreich, On the power of two-point based sampling.Journal of Complexity 5(1) (1989), 96?106.","journal-title":"Journal of Complexity"},{"key":"CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/3-540-47555-9_16","volume-title":"Advances in Cryptology-EUROCRYPT '92","author":"B. Dixon","year":"1993","unstructured":"B. Dixon andA.K. Lenstra, Massively parallel elliptic curve factoring. InAdvances in Cryptology-EUROCRYPT '92, Lecture Notes in Computer Science658, Springer-Verlag (Berlin), 1993, 183?193."},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"A.K. Lenstra, H.W. Lenstra, M.S. Manasse, and J.M. Pollard, The number field sieve. InProceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990, 564?572.","DOI":"10.1145\/100216.100295"},{"key":"CR7","series-title":"Lecture Notes in Computer Science","first-page":"69","volume-title":"Advances in Cryptology-EUROCRYPT '90","author":"A.K. Lenstra","year":"1991","unstructured":"A.K. Lenstra andM.S. Manasse, Factoring with two large primes. InAdvances in Cryptology-EUROCRYPT '90, Lecture Notes in Computer Science473, Springer-Verlag (Berlin), 1991, 69?80."},{"key":"CR8","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.Annals of Mathematics 126 (1987), 649?673.","journal-title":"Annals of Mathematics"},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"A. Menezes,Elliptic curve public key cryptosystems. Kluwer Academic Publishers, 1993.","DOI":"10.1007\/978-1-4615-3198-2"},{"key":"CR10","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.Proceedings of the Cambridge Philosophical Society 76 (1974), 521?528.","journal-title":"Proceedings of the Cambridge Philosophical Society"},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"C. Pomerance, Factoring. InCryptology and computational number theory, ed.C. Pomerance,Proceedings of the Symposium in Applied Mathematics 42, American Mathematical Society, 1990, 27?47.","DOI":"10.1090\/psapm\/042\/1095550"},{"key":"CR12","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 algorithm for testing primality.Journal of Number Theory 12 (1980), 128?138.","journal-title":"Journal of Number Theory"},{"key":"CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/3-540-39805-8_3","volume-title":"Advances in Cryptology-EUROCRYPT '85","author":"R.L. Rivest","year":"1986","unstructured":"R.L. Rivest andA. Shamir, Efficient factoring based on partial information. InAdvances in Cryptology-EUROCRYPT '85, Lecture Notes in Computer Science219, Springer-Verlag (Berlin), 1986, 31?34."},{"issue":"2","key":"CR14","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, andL. Adleman, A method for obtaining digital signatures and public-key cryptosystems.Communications of the ACM 21(2) (1978), 120?126.","journal-title":"Communications of the ACM"},{"key":"CR15","doi-asserted-by":"crossref","unstructured":"P. Shor, Algorithms for quantum computation: discrete logarithms and factoring. InProceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, 1994, 124?134.","DOI":"10.1109\/SFCS.1994.365700"},{"issue":"167","key":"CR16","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1090\/S0025-5718-1984-0744939-5","volume":"43","author":"C.P. Schnorr","year":"1984","unstructured":"C.P. Schnorr andH.W. Lenstra, A Monte Carlo factoring algorithm with linear storage.Mathematics of Computation 43(167) (July 1984), 289?311.","journal-title":"Mathematics of Computation"}],"container-title":["Computational Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01206320.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01206320\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01206320","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T22:41:31Z","timestamp":1586126491000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01206320"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,9]]},"references-count":16,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1995,9]]}},"alternative-id":["BF01206320"],"URL":"https:\/\/doi.org\/10.1007\/bf01206320","relation":{},"ISSN":["1016-3328","1420-8954"],"issn-type":[{"value":"1016-3328","type":"print"},{"value":"1420-8954","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,9]]}}}