{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T19:15:17Z","timestamp":1761765317643},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642142918"},{"type":"electronic","value":"9783642142925"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14292-5_25","type":"book-chapter","created":{"date-parts":[[2010,6,29]],"date-time":"2010-06-29T09:51:13Z","timestamp":1277805073000},"page":"234-240","source":"Crossref","is-referenced-by-count":1,"title":["An Improved Estimation of the RSA Quantum Breaking Success Rate"],"prefix":"10.1007","author":[{"given":"Piotr","family":"Zawadzki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5&6","key":"25_CR1","first-page":"522","volume":"7","author":"P.S. Bourdon","year":"2007","unstructured":"Bourdon, P.S., Williams, H.T.: Probability estimates for Shors algorithm. Quant. Inf. Comput.\u00a07(5&6), 522\u2013550 (2007)","journal-title":"Quant. Inf. Comput."},{"issue":"3","key":"25_CR2","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1103\/RevModPhys.68.733","volume":"68","author":"A. Ekert","year":"1996","unstructured":"Ekert, A., Jozsa, R.: Quantum computation and Shor\u2019s factoring algorithm. Rev. Mod. Phys.\u00a068(3), 733\u2013753 (1996)","journal-title":"Rev. Mod. Phys."},{"issue":"6","key":"25_CR3","first-page":"521","volume":"73","author":"E. Gerjuoy","year":"2005","unstructured":"Gerjuoy, E.: Shor\u2019s factoring algorithm and modern cryptography. An\u00a0illustration\u00a0of\u00a0the\u00a0capabilities inherent in\u00a0quantum computers. Am. J. Phys.\u00a073(6), 521\u2013540 (2005), \n                    \n                      http:\/\/arxiv.org\/pdf\/quant-ph\/0411184","journal-title":"An\u00a0illustration\u00a0of\u00a0the\u00a0capabilities inherent in\u00a0quantum computers. Am. J. Phys."},{"key":"25_CR4","unstructured":"Knill, E.: On Shor\u2019s quantum factor finding algorithm: Increasing the probability of success and tradeoffs involving the Fourier Transform modulus. Tech. Rep. LAUR-95-3350, Los Alamos National Laboratory (1995), \n                    \n                      http:\/\/www.eskimo.com\/~knill\/cv\/reprints\/knill:qc1995c.ps"},{"key":"25_CR5","unstructured":"McAnally, D.: A refinement of Shor\u2019s algorithm (2001), \n                    \n                      http:\/\/xxx.lanl.gov\/pdf\/quant-ph\/0112055"},{"key":"25_CR6","volume-title":"Quantum Computation and Quantum Information","author":"M.A. Nielsen","year":"2000","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)"},{"key":"25_CR7","volume-title":"Applied Cryptography","author":"B. Schneier","year":"1996","unstructured":"Schneier, B.: Applied Cryptography. John Wiley & Sons, Chichester (1996)"},{"key":"25_CR8","doi-asserted-by":"crossref","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P.W. Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Sci. Statist. Comput.\u00a026, 1484\u20131509 (1997), \n                    \n                      http:\/\/www.citebase.org\/abstract?id=oai:arXiv.org:quant-ph\/9508027","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1038\/414883a","volume":"414","author":"L.M.K. Vandersypen","year":"2001","unstructured":"Vandersypen, L.M.K., Steffen, M., Breyta, G., Yannoni, C.S., Sherwood, M.H., Chuang, I.L.: Experimental realization of Shor\u2019s quantum factoring algorithm using nuclear magnetic resonance. Nature\u00a0414, 883\u2013887 (2001)","journal-title":"Nature"},{"key":"25_CR10","first-page":"223","volume-title":"Internet\u2013 Technical Developments and Applications. Advances in Intelligent and Soft Computing","author":"P. Zawadzki","year":"2009","unstructured":"Zawadzki, P.: A numerical simulation of quantum factorization success probability. In: Tkacz, E., Kapczyski, A. (eds.) Internet\u2013 Technical Developments and Applications. Advances in Intelligent and Soft Computing, vol.\u00a064, pp. 223\u2013231. Springer, Heidelberg (2009)"}],"container-title":["Communications in Computer and Information Science","Networked Digital Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14292-5_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T08:23:26Z","timestamp":1619771006000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14292-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642142918","9783642142925"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14292-5_25","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2010]]}}}