메뉴 건너뛰기




Volumn 87 CCIS, Issue PART 1, 2010, Pages 234-240

An improved estimation of the RSA quantum breaking success rate

Author keywords

factorization; Quantum computation

Indexed keywords

DISCRETE LEVELS; EMPIRICAL FORMULAS; FACTORIZATION ALGORITHMS; LINEAR TIME COMPLEXITY; NUMERICAL SIMULATION; PARALLELIZATIONS; QUANTUM COMPUTATION; RANDOM PARAMETERS; RSA CRYPTOSYSTEMS; SHOR'S ALGORITHMS;

EID: 77955741280     PISSN: 18650929     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-642-14292-5_25     Document Type: Conference Paper
Times cited : (1)

References (10)
  • 1
    • 34547521208 scopus 로고    scopus 로고
    • Probability estimates for Shors algorithm
    • Bourdon, P.S., Williams, H.T.: Probability estimates for Shors algorithm. Quant. Inf. Comput. 7(5&6), 522-550 (2007)
    • (2007) Quant. Inf. Comput. , vol.7 , Issue.5-6 , pp. 522-550
    • Bourdon, P.S.1    Williams, H.T.2
  • 2
    • 0030520263 scopus 로고    scopus 로고
    • Quantum computation and Shor's factoring algorithm
    • Ekert, A., Jozsa, R.: Quantum computation and Shor's factoring algorithm. Rev. Mod. Phys. 68(3), 733-753 (1996)
    • (1996) Rev. Mod. Phys. , vol.68 , Issue.3 , pp. 733-753
    • Ekert, A.1    Jozsa, R.2
  • 3
    • 21244493696 scopus 로고    scopus 로고
    • Shor's factoring algorithm and modern cryptography. An illustration of the capabilities inherent in quantum computers
    • 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
    • (2005) Am. J. Phys. , vol.73 , Issue.6 , pp. 521-540
    • Gerjuoy, E.1
  • 8
    • 0142051871 scopus 로고    scopus 로고
    • Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
    • 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
    • (1997) SIAM J. Sci. Statist. Comput. , vol.26 , pp. 1484-1509
    • Shor, P.W.1
  • 9
    • 0035924370 scopus 로고    scopus 로고
    • Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance
    • 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)
    • (2001) Nature , vol.414 , pp. 883-887
    • Vandersypen, L.M.K.1    Steffen, M.2    Breyta, G.3    Yannoni, C.S.4    Sherwood, M.H.5    Chuang, I.L.6
  • 10
    • 77955731611 scopus 로고    scopus 로고
    • A numerical simulation of quantum factorization success probability
    • Tkacz, E., Kapczyski, A. (eds.) Springer, Heidelberg
    • 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)
    • (2009) Internet- Technical Developments and Applications. Advances in Intelligent and Soft Computing , vol.64 , pp. 223-231
    • Zawadzki, P.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.