Affiliate disclosure

Book titles on this page link to Amazon. As an Amazon Associate, DataField.Dev earns from qualifying purchases — at no additional cost to you.

Further Reading: Chapter 15 — Shor's Algorithm — Factoring Large Numbers in Polynomial Time (and Why It Breaks RSA Encryption)

  1. Shor, P. W. (1994). "Algorithms for quantum computation: discrete logarithms and factoring." Proceedings 35th Annual Symposium on Foundations of Computer Science, 124–134.
  2. Shor, P. W. (1997). "Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer." SIAM Journal on Computing, 26(5), 1484–1509.
  3. Vandersypen, L. M. K., et al. (2001). "Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance." Nature, 414, 883–887.
  4. Martín-López, E., et al. (2012). "Experimental realization of Shor's quantum factoring algorithm using qubit recycling." Nature Photonics, 6, 773–776.
  5. Nielsen, M. A. & Chuang, I. L. (2010). Quantum Computation and Quantum Information, Chapter 5. Cambridge University Press.
  6. Gidney, C. & Ekerå, M. (2021). "How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits." Quantum, 5, 433.
  7. Preskill, J. (2018). "Quantum Computing in the NISQ era and beyond." Quantum, 2, 79.
  8. NIST (2024). "Post-Quantum Cryptography Standardization." FIPS 203, 204, 205.