{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:55:35Z","timestamp":1764996935763},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,2,8]],"date-time":"2012-02-08T00:00:00Z","timestamp":1328659200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["comput. complex."],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1007\/s00037-012-0037-5","type":"journal-article","created":{"date-parts":[[2012,2,7]],"date-time":"2012-02-07T12:29:47Z","timestamp":1328617787000},"page":"421-429","source":"Crossref","is-referenced-by-count":4,"title":["On reducing factorization to the discrete logarithm problem modulo a composite"],"prefix":"10.1007","volume":"21","author":[{"given":"Jacek","family":"Pomyka\u0142a","sequence":"first","affiliation":[]},{"given":"Bartosz","family":"\u0179ra\u0142ek","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,2,8]]},"reference":[{"key":"37_CR1","unstructured":"L. M. Adleman & K. S. McCurley (1994). Open problems in number theoretic complexity II. In: Algorithmic Number Theory, First International Symposium, ANTS-I, Ithaca, NY, USA, 291\u2013322. Springer-Verlag."},{"key":"37_CR2","unstructured":"E. Bach (1984). Discrete logarithms and factoring. Technical Report UCB\/CSD-84-186, EECS Department, University of California, Berkeley. http:\/\/www.eecs.berkeley.edu\/Pubs\/TechRpts\/1984\/5973.html ."},{"key":"37_CR3","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/s001459900030","volume":"10","author":"D. Coppersmith","year":"1997","unstructured":"Coppersmith D. (1997) Small solutions to polynomial equations and low exponent RSA vulnerabilities. Journal of Cryptology 10: 233\u2013260","journal-title":"Journal of Cryptology"},{"key":"37_CR4","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s00145-006-0433-6","volume":"20","author":"J.-S. Coron","year":"2007","unstructured":"Coron J.-S., May A. (2007) Deterministicpolynomial-time equivalence of computing the RSA secret key and factoring. Journal of Cryptology 20: 39\u201350","journal-title":"Journal of Cryptology"},{"key":"37_CR5","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1137\/0406010","volume":"6","author":"D.M. Gordon","year":"1993","unstructured":"Gordon D.M. (1993) Discrete logarithms in GF(p) using the number field sieve. SIAM Journal on Discrete Mathematics 6: 124\u2013138","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"37_CR6","doi-asserted-by":"crossref","unstructured":"A. K. Lenstra & H. W. Lenstra (editors) (1993). The development of the number field sieve, volume 1554. Lecture Notes in Mathematics. Springer-Verlag.","DOI":"10.1007\/BFb0091534"},{"key":"37_CR7","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A.K. Lenstra","year":"1982","unstructured":"Lenstra A.K., Lenstra H.W., Lov\u00e1sz L. (1982) Factoring polynomials with rational coefficients. Mathematische Annalen 261: 515\u2013534","journal-title":"Mathematische Annalen"},{"key":"37_CR8","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF02351718","volume":"1","author":"K.S. McCurley","year":"1988","unstructured":"McCurley K.S. (1988) A key distribution system equivalent to factoring. Journal of Cryptology 1: 95\u2013105","journal-title":"Journal of Cryptology"},{"key":"37_CR9","unstructured":"J. McKee & R. Pinch (1996). Old and new deterministic factoring algorithms. In: Algorithmic Number Theory, Second International Symposium, ANTS-II, Talence, France, 217\u2013224. Springer-Verlag."},{"key":"37_CR10","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1090\/S0025-5718-09-02262-5","volume":"79","author":"B. \u0179ra\u0142ek","year":"2010","unstructured":"\u0179ra\u0142ek B. (2010) A deterministic version of Pollard\u2019s p\u22121 algorithm. Mathematics of Computation 79: 513\u2013533","journal-title":"Mathematics of Computation"}],"container-title":["computational complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00037-012-0037-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00037-012-0037-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00037-012-0037-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T08:38:47Z","timestamp":1561279127000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00037-012-0037-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,8]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["37"],"URL":"https:\/\/doi.org\/10.1007\/s00037-012-0037-5","relation":{},"ISSN":["1016-3328","1420-8954"],"issn-type":[{"value":"1016-3328","type":"print"},{"value":"1420-8954","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,8]]}}}