{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T12:18:13Z","timestamp":1773317893760,"version":"3.50.1"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,10,24]],"date-time":"2014-10-24T00:00:00Z","timestamp":1414108800000},"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 Cryptol"],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1007\/s00145-014-9192-y","type":"journal-article","created":{"date-parts":[[2014,10,23]],"date-time":"2014-10-23T21:51:26Z","timestamp":1414101086000},"page":"220-241","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Breaking RSA May Be As Difficult As Factoring"],"prefix":"10.1007","volume":"29","author":[{"given":"Daniel R. L.","family":"Brown","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,10,24]]},"reference":[{"key":"9192_CR1","doi-asserted-by":"crossref","unstructured":"D. Aggarwal, U. Maurer, Breaking RSA generically is equivalent to factoring, in A. Joux, editor, Advances in Cryptology\u2014EUROCRYPT 2009, Number 5479 in LNCS (IACR, Springer, Berlin, 2009), pp. 36\u201353.","DOI":"10.1007\/978-3-642-01001-9_2"},{"key":"9192_CR2","unstructured":"D. Boneh, Twenty years of attacks on the RSA cryptosystem. Not. Am. Math. Soc. \n                           46(2), 203\u2013213 (1999). \n                    http:\/\/crypto.stanford.edu\/~dabo\/abstracts\/RSAattack-survey.html\n                    \n                  ."},{"key":"9192_CR3","doi-asserted-by":"crossref","unstructured":"D. Boneh, R. Venkatesan, Breaking RSA may be easier than factoring, in Nyberg [10], pp. 59\u201371. \n                    http:\/\/crypto.stanford.edu\/~dabo\/abstracts\/no_rsa_red.html\n                    \n                  .","DOI":"10.1007\/BFb0054117"},{"key":"9192_CR4","doi-asserted-by":"crossref","unstructured":"J.-S. Coron, A. May, Deterministic polynomial-time equivalence of computing the RSA secret key and factoring. J. Cryptol. \n                           20(1), 39\u201350 (2007)","DOI":"10.1007\/s00145-006-0433-6"},{"key":"9192_CR5","doi-asserted-by":"crossref","unstructured":"I. Damg\u00e5rd, M. Koprowski, Generic lower bounds for root extraction and signature schemes in general groups, in L. Knudsen, editor, Advances in Cryptology\u2014EUROCRYPT 2002, Number 2332 in LNCS (IACR, Springer, Berlin), pp. 256\u2013271","DOI":"10.1007\/3-540-46035-7_17"},{"key":"9192_CR6","doi-asserted-by":"crossref","unstructured":"J. M. de Laurentis, A further weakness in the common modulus protocol for the RSA cryptoalgorithm. Cryptologia \n                           8, 253\u2013259 (1984)","DOI":"10.1080\/0161-118491859060"},{"key":"9192_CR7","doi-asserted-by":"crossref","unstructured":"G. Leander, A. Rupp, On the equivalence of RSA and factoring regarding generic ring algorithms, in X. Lai, K. Chen, editors, Advances in Cryptology\u2014ASIACRYPT 2006, Number 4284 in LNCS (IACR, Springer, Berlin, 2006), pp. 241\u2013251","DOI":"10.1007\/11935230_16"},{"key":"9192_CR8","unstructured":"A.J. Menezes, P.C. van Oorschot, S.A. Vanstone, Handbook of Applied Cryptography. (CRC Press, Boca Raton, FL, 1997)"},{"key":"9192_CR9","doi-asserted-by":"crossref","unstructured":"G.L. Miller, Riemann\u2019s hypothesis and test for primality. J. Comput. Syst. Sci. \n                           13(3), 300\u2013317 (1976)","DOI":"10.1016\/S0022-0000(76)80043-8"},{"key":"9192_CR10","doi-asserted-by":"crossref","unstructured":"K. Nyberg, editor, Advances in Cryptology\u2014EUROCRYPT \u201998, Number 1403 in LNCS. (IACR, Springer, Berlin, 1998)","DOI":"10.1007\/BFb0054112"},{"key":"9192_CR11","doi-asserted-by":"crossref","unstructured":"T. Okamoto, S. Uchiyama, Security of an identity-based cryptosystem and the related reductions, in Nyberg [10], pp. 546\u2013560","DOI":"10.1007\/BFb0054153"},{"key":"9192_CR12","unstructured":"M.O. Rabin, Digitalized Signatures and Public-Key Functions as Intractable as Factorization. LCS\/TR 212 (MIT, 1979)."},{"key":"9192_CR13","unstructured":"R.L. Rivest, B. Kaliski, Encyclopedia of Cryptography and Security, Chapter RSA Problem. (Kluwer, Dordrecht, 2002). To appear. \n                    http:\/\/theory.lcs.mit.edu\/~rivest\/RivestKaliski-RSAProblem.pdf"},{"key":"9192_CR14","doi-asserted-by":"crossref","unstructured":"R.L. Rivest, A. Shamir, L.M. Adleman, A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM \n                           21, 120\u2013126 (1978)","DOI":"10.1145\/359340.359342"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-014-9192-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-014-9192-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-014-9192-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-014-9192-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:17:42Z","timestamp":1586333862000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-014-9192-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,24]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["9192"],"URL":"https:\/\/doi.org\/10.1007\/s00145-014-9192-y","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,24]]},"assertion":[{"value":"23 December 2005","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 October 2014","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}