{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T01:23:48Z","timestamp":1648776228074},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,2,1]],"date-time":"2009-02-01T00:00:00Z","timestamp":1233446400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["New Gener. Comput."],"published-print":{"date-parts":[[2009,2]]},"DOI":"10.1007\/s00354-008-0059-3","type":"journal-article","created":{"date-parts":[[2009,4,18]],"date-time":"2009-04-18T06:18:41Z","timestamp":1240035521000},"page":"159-176","source":"Crossref","is-referenced-by-count":5,"title":["Factorizing RSA Keys, An Improved Analogue Solution"],"prefix":"10.1007","volume":"27","author":[{"given":"Ed","family":"Blakey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,4,19]]},"reference":[{"key":"59_CR1","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1126\/science.7973651","volume":"266","author":"L.M. Adleman","year":"1994","unstructured":"Adleman, L. M., \u201cMolecular Computation of Solutions to Combinatorial Problems,\u201d Science 266, pp. 1021\u20131024, 1994.","journal-title":"Science"},{"key":"59_CR2","unstructured":"Blakey, E., \u201cAn Analogue Solution to the Problem of Factorization,\u201d Oxford University Computing Science Research Report CS-RR-07-04, 2007. Available at ftp:\/\/ftp.comlab.ox.ac.uk\/pub\/Documents\/techreports\/RR-07-04.pdf ."},{"key":"59_CR3","doi-asserted-by":"crossref","unstructured":"Blakey, E., \u201cFactorizing RSA Keys (An Improved Analogue Solution,\u201d in Natural Computing, Proceedings in Information and Communications Technology, vol. 1 (Suzuki, Y., Hagiya, M., Umeo, H. and Adamatzky, A. eds), Springer, pp. 16\u201327, 2008. Available at http:\/\/users.ox.ac.uk\/~quee1871\/factor_iwnc.pdf .","DOI":"10.1007\/978-4-431-88981-6_2"},{"key":"59_CR4","unstructured":"Blakey, E., \u201cOn the Computational Complexity of Physical Computing Systems,\u201d in Unconventional Computing 2007 (Adamatzky, A., Bull, L., De Lacy Costello, B., Stepney, S. and Teuscher, C. editors), Luniver Press, pp. 95\u2013115, 2007. Available at http:\/\/users.ox.ac.uk\/~quee1871\/ uc07_paper.pdf\" ."},{"key":"59_CR5","unstructured":"Blakey, E., \u201cSystem and Method for Finding Integer Solutions,\u201d United States patent 7453574, 2007."},{"issue":"2","key":"59_CR6","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/321386.321395","volume":"14","author":"M. Blum","year":"1967","unstructured":"Blum, M., \u201cA Machine-Independent Theory of the Complexity of Recursive Functions,\u201d Journal of the Association for Computing Machinery 14, 2, pp. 322\u2013336, 1967.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"59_CR7","unstructured":"Bovet, D. P. and Crescenzi, P., Introduction to the Theory of Complexity, Prentice Hall, 1994."},{"key":"59_CR8","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/3-540-44968-X_2","volume":"1858","author":"R.P. Brent","year":"2000","unstructured":"Brent, R. P., \u201cRecent Progress and Prospects for Integer Factorisation Algorithms,\u201d Lecture Notes in Computer Science 1858, pp. 3\u201320, 2000.","journal-title":"Lecture Notes in Computer Science"},{"key":"59_CR9","doi-asserted-by":"crossref","first-page":"345","DOI":"10.2307\/2371045","volume":"58","author":"A. Church","year":"1936","unstructured":"Church, A., \u201cAn Unsolvable Problem of Elementary Number Theory,\u201d American Journal of Mathematics 58, pp. 345\u2013363, 1936.","journal-title":"American Journal of Mathematics"},{"issue":"2","key":"59_CR10","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1287\/opre.6.2.232","volume":"6","author":"W. Miehle","year":"1958","unstructured":"Miehle, W., \u201cLink-Length Minimization in Networks,\u201d Operations Research 6, 2, pp. 232\u2013243, 1958.","journal-title":"Operations Research"},{"key":"59_CR11","doi-asserted-by":"crossref","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P.W. Shor","year":"1997","unstructured":"Shor, P. W., \u201cPolynomial Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer,\u201d SIAM Journal of Computing 26, pp. 1484\u20131509, 1997.","journal-title":"SIAM Journal of Computing"},{"key":"59_CR12","unstructured":"Sipser, M., Introduction to the Theory of Computation, PWS, 1997."}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00354-008-0059-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00354-008-0059-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00354-008-0059-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:27:50Z","timestamp":1559039270000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00354-008-0059-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,2]]}},"alternative-id":["59"],"URL":"https:\/\/doi.org\/10.1007\/s00354-008-0059-3","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"value":"0288-3635","type":"print"},{"value":"1882-7055","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,2]]}}}