Skip to main content
SpringerLink
Log in

A new quantum algorithm for computing RSA ciphertext period

  • Computer Science
  • Published:
Wuhan University Journal of Natural Sciences

Abstract

Shor proposed a quantum polynomial-time integer factorization algorithm to break the RSA public-key cryptosystem. In this paper, we propose a new quantum algorithm for breaking RSA by computing the order of the RSA ciphertext C. The new algorithm has the following properties: 1) recovering the RSA plaintext M from the ciphertext C without factoring n; 2) avoiding the even order of the element; 3) having higher success probability than Shor’s; 4) having the same complexity as Shor’s.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Yan S Y. Computational Number Theory and Modern Cryptography [M]. Beijing: Higher Education Press, 2013(Ch).

    Google Scholar 

  2. Yan S Y. Number Theory for Computing [M]. 2nd Edition. Berlin: Springer-Verlag, 2002.

    Book  Google Scholar 

  3. Yan S Y. Primality Testing and Integer Factorization in Public-key Cryptography [M]. 2nd Edition. Berlin: Springer-Verlag, 2009.

    Book  Google Scholar 

  4. Rivest R L, Shamir A, Adleman L. A method for obtaining digital signatures and public key cryptosystems [J]. Communications of the ACM, 1978, 21(2): 120–126.

    Article  Google Scholar 

  5. Pomerance C. Smooth numbers and the quadratic sieve [C] // Algorithmic Number Theory. Cambridge: University Press, 2008,44: 69–81.

    Google Scholar 

  6. Lenstra A K, Lenstra H W. The Development of the Number Field Sieve, Lecture Notes in Mathematics 1554 [M]. Berlin: Springer-Verlag, 1993.

    Google Scholar 

  7. Shor P W. Algorithms for quantum computation: discrete logarithms and factoring [C] // Proceedings of 35th Annual Symposium on Foundations of Computer Science. Washington D C: IEEE Computer Society Press, 1994: 124–134.

    Chapter  Google Scholar 

  8. Shor P W. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer [J]. SIAM Journal on Computing, 1997, 26(5): 1484–1509.

    Article  Google Scholar 

  9. Yan S Y. Cryptanalytic Attacks on RSA [M]. Berlin: Spring-Verlag, 2008.

    Google Scholar 

  10. Nielson M A, Chuang I L. Quantum Computation and Quantum Information [M]. Cambridge: Cambridge University Press, 2000.

    Google Scholar 

  11. Long G L, Pei S Y, Zeng J Y. Recent Progress in Quantum Mechanics, Fourth Volume [M]. Beijing: Tsinghua University Press, 2007 ( Ch).

    Google Scholar 

  12. Wang Y H, Yan S Y. A new quantum algorithm for breaking RSA [J]. Computer Science, 2016, 43(4):24–27(Ch).

    CAS  Google Scholar 

  13. Zhang H G, Wang L N, Du R Y, et al. Research on information security discipline [J]. Journal of Wuhan University (Natural Science Edition), 2010, 56(5): 614–620(Ch).

    Google Scholar 

  14. Zhang H G, Han W B, Lai X J, et al. Survey on cyberspace security [J]. Science China Information Sciences, 2015, 58(11): 1101011–43.

    Google Scholar 

  15. Smolin J A, Smith G, Vargo A. Oversimplifying quantum factoring [J]. Nature, 2013, 499(7457): 163–165.

    Article  CAS  PubMed  Google Scholar 

  16. Gilowski M, Wendrich T, Müller T, et al. Gauss sum factoring with cold atoms [J]. Physical Review Letters, 2008,100(3): 0302011–4.

    Article  Google Scholar 

  17. Peng X H, Liao Z Y, Xu N Y, et al. Quantum adiabatic algorithm for factorization and its experimental implementation [J]. Physical Review Letters, 2008, 101(22): 2204051–4.

    Article  Google Scholar 

  18. Xu N Y, Zhu J, Lu D W, et al. Quantum factorization of 143 on a dipolar-coupling nuclear magnetic resonance system [J]. Physical Review Letters, 2012, 108(13): 1305011–5.

    Article  Google Scholar 

  19. Geller M R, Zhou Z Y. Factoring 51 and 85 with 8 qubits [J]. Scientific Reports, 2013, 3(3023): 1–5.

    Google Scholar 

  20. Parker S, Plenio M B. Efficient factorization with a single qubit and logN mixed qubits [J]. Physical Review Letters, 2000, 85(14): 3049–3052.

    Article  CAS  PubMed  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer, Wuhan University, Wuhan 430072, Hubei, China

    Yahui Wang, Songyuan Yan & Huanguo Zhang

Authors
  1. Yahui Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Songyuan Yan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Huanguo Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yahui Wang.

Additional information

Foundation item: Supported by the National Natural Science Foundation of China (61303212, 61202386), the State Key Program of National Natural Science of China (61332019), the Major Research Plan of the National Natural Science Foundation of China (91018008, SKLSE-2015-A-02)

Biography: WANG Yahui, female, Ph.D. candidate, research direction: quantum computing and cryptography.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wang, Y., Yan, S. & Zhang, H. A new quantum algorithm for computing RSA ciphertext period. Wuhan Univ. J. Nat. Sci. 22, 68–72 (2017). https://doi.org/10.1007/s11859-017-1218-5

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11859-017-1218-5

Keywords

CLC number

Search

Navigation