Factoring Safe Semiprimes with a Single Quantum Query

J. M. Pollard, “Theorems on factorization and primality testing,” Mathematical Proceedings of the Cambridge Philosophical Society

1974

Earlier work this paper cites.

G. L. Miller, “Riemann’s hypothesis and tests for primality,” Journal of Computer and System Sciences

1976

Earlier work this paper cites.

R. L. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital signatures and public-key cryptosystems,” Communications of the ACM

1978

Earlier work this paper cites.

H. W. Lenstra, Jr., “Factoring integers with elliptic curves,” Ann. of Math. (2)

1987

Earlier work this paper cites.

Ed. S. Goldwasser

P. W. Shor, “Algorithms for quantum computation: Discrete logarithms and factoring,” in Proc. 35th Annu. Symp. Foundations of Computer Science and IEEE Computer Society and Los Alamitos and CA · 1994

Earlier work this paper cites.

D. Coppersmith, “An approximate Fourier transform useful in quantum factoring,” Tech. Rep. RC 19642, IBM, 1994

1994

Earlier work this paper cites.

E. Knill, “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

1995

Earlier work this paper cites.

P. W. Shor, “Polynomial time algorithms for prime factorization and discrete logarithms on a quantum computer,” SIAM J. Sci. Statist. Comput

1997

Earlier work this paper cites.

Cambridge U.P., 2000

M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information · 2000

Earlier work this paper cites.

R. Cramer and V. Shoup, “Signature schemes based on the strong RSA assumption,” ACM Trans. Inf. Syst. Secur

2000

Cited alongside, same era.

R. Cleve and J. Watrous, “Fast parallel circuits for the quantum Fourier transform,” in Proceedings 41st Annual Symposium on Foundations of Computer Science

2000

Cited alongside, same era.

L. M. K. Vandersypen, M. Steffen, G. Breyta, C. S. Yannoni, M. H. Sherwood, and I. L. Chuang, “Experimental realization of Shor’s quantum factoring algorithm using nuclear magnetic resonance,” Nature

2001

Cited alongside, same era.

R. L. Rivest and R. D. Silverman, “Are ‘strong’ primes needed for RSA?.” Cryptology ePrint Archive, Report 2001/007, 2001

2001

Cited alongside, same era.

G. Leander, “Improving the Success Probability for Shor’s Factoring Algorithm,” arXiv:quant-ph/0208183

2002

Cited alongside, same era.

R. Laubenbacher and D. Pengelley, “‘Voici ce que j’ai trouvé:’ Sophie Germain’s grand plan to prove Fermat’s last theorem,” Historia Mathematica

2010

Later among the works it cites.

E. Martin-Lopez, A. Laing, T. Lawson, R. Alvarez, X.-Q. Zhou, and J. L. O’Brien, “Experimental realization of Shor’s quantum factoring algorithm using qubit recycling,” Nat Photon

2012

Later among the works it cites.

E. Lucero, R. Barends, Y. Chen, J. Kelly, M. Mariantoni, A. Megrant, P. O’Malley, D. Sank, A. Vainsencher, J. Wenner, T. White, Y. Yin, A. N. Cleland, and J. M. Martinis, “Computing prime factors with a Josephson phase qubit quantum processor,” Nat Phys

2012

Later among the works it cites.

I. L. Markov and M. Saeedi, “Constant-optimized quantum circuits for modular multiplication and exponentiation,” Quantum Info. Comput

2012

Later among the works it cites.