Abstract
The security of RSA cryptosystem is based on the assumption that factorization is a difficult problem from the number theoretic point of view. But that statement does not hold with regard to quantum computers where massive parallelization of computations leads to qualitative speedup. The Shor’s quantum factorization algorithm is one the most famous algorithms ever proposed. That algorithm has linear time complexity but is of probabilistic nature. It succeeds only when some random parameter fed at algorithm input has desired properties. It is well known that such parameters are found with probability not less than 1/2. However, the described in the paper numerical simulations prove that probability of such event exhibits grouping at some discrete levels above that limit. Thus, one may conclude that usage of the common bound leads to underestimation of the successful factorization probability. Empirical formulas on expected success probability introduced in the paper give rise to the more profound analysis of the Shor’s algorithm classic part behaviour. The observed grouping still awaits for explanations based on number theory.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bourdon, P.S., Williams, H.T.: Probability estimates for Shors algorithm. Quant. Inf. Comput. 7(5&6), 522–550 (2007)
Ekert, A., Jozsa, R.: Quantum computation and Shor’s factoring algorithm. Rev. Mod. Phys. 68(3), 733–753 (1996)
Gerjuoy, E.: Shor’s factoring algorithm and modern cryptography. An illustration of the capabilities inherent in quantum computers. Am. J. Phys. 73(6), 521–540 (2005), http://arxiv.org/pdf/quant-ph/0411184
Knill, E.: On Shor’s 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), http://www.eskimo.com/~knill/cv/reprints/knill:qc1995c.ps
McAnally, D.: A refinement of Shor’s algorithm (2001), http://xxx.lanl.gov/pdf/quant-ph/0112055
Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)
Schneier, B.: Applied Cryptography. John Wiley & Sons, Chichester (1996)
Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Sci. Statist. Comput. 26, 1484–1509 (1997), http://www.citebase.org/abstract?id=oai:arXiv.org:quant-ph/9508027
Vandersypen, L.M.K., Steffen, M., Breyta, G., Yannoni, C.S., Sherwood, M.H., Chuang, I.L.: Experimental realization of Shor’s quantum factoring algorithm using nuclear magnetic resonance. Nature 414, 883–887 (2001)
Zawadzki, P.: A numerical simulation of quantum factorization success probability. In: Tkacz, E., Kapczyski, A. (eds.) Internet– Technical Developments and Applications. Advances in Intelligent and Soft Computing, vol. 64, pp. 223–231. Springer, Heidelberg (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zawadzki, P. (2010). An Improved Estimation of the RSA Quantum Breaking Success Rate. In: Zavoral, F., Yaghob, J., Pichappan, P., El-Qawasmeh, E. (eds) Networked Digital Technologies. NDT 2010. Communications in Computer and Information Science, vol 87. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14292-5_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-14292-5_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14291-8
Online ISBN: 978-3-642-14292-5
eBook Packages: Computer ScienceComputer Science (R0)