EDP Sciences logo
Submit your paper
Search
Menu
All issues Volume 31 / No 3 (June 2026) Wuhan Univ. J. Nat. Sci., 31 3 (2026) 241-249 References
Open Access
Issue
Wuhan Univ. J. Nat. Sci.
Volume 31, Number 3, June 2026
Page(s) 241 - 249
DOI https://doi.org/10.1051/wujns/2026313241
Published online 24 June 2026
  1. Shor P W. Algorithms for quantum computation: Discrete logarithms and factoring [C]//Proceedings of 35th Annual Symposium on Foundations of Computer Science. New York:IEEE Computer Society Press, 1994:124-134. [Google Scholar]
  2. 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. [Google Scholar]
  3. Zhang H G, Han W Y, Lai X J, et al. Survey on cyberspace security[J]. Science China Information Sciences, 2024, 58: 1-43. [Google Scholar]
  4. Lenstra A K, Lenstra H W. The development of the number field sieve[C]//Lecture Notes in Mathematics 1554. Berlin:Springer-Verlag, 1993. [Google Scholar]
  5. Battarbee C, Kahrobaei D, Perret L, et al. A subexponential quantum algorithm for the semidirect discrete logarithm problem[C]//Post-Quantum Cryptography. Cham: Springer-Vrverlag, 2024: 202-226. [Google Scholar]
  6. Wu W Q, Zhang H G, Mao S W, et al. A public key cryptosystem based on data complexity under quantum environment[J]. Science China Information Sciences, 2015, 58(11): 1-11. [NASA ADS] [Google Scholar]
  7. Zhang H G, Mao S W, Wu W Q, et al. Overview of quantum computation complexity theory[J]. Chinese Journal of Computers, 2016, 39(12): 2403-2428(Ch). [Google Scholar]
  8. Regev O. An efficient quantum factoring algorithm[J]. Journal of the ACM, 2025, 72(1): 1-13. [Google Scholar]
  9. Biswas S, Das P. Analysis of quantum cryptology and the RSA algorithms defense against attacks using Shor's algorithm in a post quantum environment[M]//Computational Intelligence in Communications and Business Analytics. Cham: Springer-Verlag, 2023: 72-87. [Google Scholar]
  10. Wu W Q, Wu J H, Guo L N. Multi-party quantum private comparison based on bell states[J]. Entropy, 2023, 25(8): 1156. [Google Scholar]
  11. Imran M, Ivanyos G. Efficient quantum algorithms for some instances of the semidirect discrete logarithm problem[J]. Designs, Codes and Cryptography, 2024, 92(10): 2825-2843. [Google Scholar]
  12. Ha J, Lee J, Heo J. Resource analysis of quantum computing with noisy qubits for Shor's factoring algorithms[J]. Quantum Information Processing, 2022, 21(2): 60. [Google Scholar]
  13. Wang C, Wang Q D, Hong C L, et al. Quantum annealing public key cryptographic attack algorithm based on D-wave advantage[J]. Chinese Journal of Computers, 2024, 47(5): 1030-1044(Ch). [Google Scholar]
  14. Wang B N, Yao H N, Hu F, et al. Quantum annealing distributed integer decomposition study of local field coefficient h and coupling coefficient J with stability Ising model[J]. Scientia Sinica: Physica, Mechanica & Astronomica, 2020, 50(3):030301(Ch). [Google Scholar]
  15. 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): 130501. [Google Scholar]
  16. Lucero E, Barends R, Chen Y, et al. Computing prime factors with a Josephson phase qubit quantum processor[J]. Nature Physics, 2012, 8(10): 719-723. [Google Scholar]
  17. Monz T, Nigg D, Martinez E A, et al. Realization of a scalable Shor algorithm[J]. Science, 2016, 351(6277): 1068-1070. [Google Scholar]
  18. Kumar M, Mondal B. Study on implementation of Shor's factorization algorithm on quantum computer[J]. SN Computer Science, 2024, 5(4): 413. [Google Scholar]
  19. Cao Z J, Cao Z F, On Shor's factoring algorithm with more registers and the problem to certify quantum computers[EB/OL]. [2014-09-10]. https://arxiv.org/abs/1409.7352. [Google Scholar]
  20. Ekerå M, Håstad J. Quantum algorithms for computing short discrete logarithms and factoring RSA integers[C]//Post-Quantum Cryptography. Cham: Springer International Publishing, 2017: 347-363. [Google Scholar]
  21. Tesoro M, Siloi, Jaschke D, et al. Quantum inspired factorization up to 100-bit RSA number in polynomial time[EB/OL]. [2024-12-12]. https://arxiv.org/abs/2410.16355. [Google Scholar]
  22. Wang Y H, Zhang H G. Quantum algorithm for attacking RSA based on Fourier transform and fixed-point[J]. Wuhan University Journal of Natural Sciences, 2021, 26(6): 489-494. [Google Scholar]
  23. Smolin J A, Smith G, Vargo A. Oversimplifying quantum factoring[J]. Nature, 2013, 499(7457): 163-165. [CrossRef] [PubMed] [Google Scholar]
  24. Xiao L, Luo L, Mateus P. Distributed Shor's algorithm[J]. Quantum Information and Computation, 2022, 23(1&2):27-44. [Google Scholar]
  25. Nielsen M A, Chuang I L. Quantum Computation and Quantum Information[M]. Cambridge: Cambridge University Press, 2000. [Google Scholar]
  26. Liu L H, Cao Z J. On computing Formula and its application[J]. Information and Computation, 2006, 204(7): 1173-1178. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.