Quantum algorithms for computing short discrete logarithms and factoring RSA integers

Built on

J. Håstad, A. Schrift, A. Shamir, “The Discrete Logarithm Modulo a Composite Hides O(n) bits” , in Journal of Computer and System Science, Vol 47, No 3, 1993, pp 376-404
1993
Earlier work this paper cites.
P. W. Shor, “Algorithms for Quantum Computation: Discrete Logarithms and Factoring” , in proceeding from the 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, November 20–22, 1994, IEEE Computer Society Press, pp. 124–134
1994
Earlier work this paper cites.

P. W. Shor, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer” , in SIAM Journal of Computing, volume 26, no 5, 1997, pp. 1484-1509
1997
Cited alongside, same era.
M. Mosca, A. Ekert, “ The Hidden Subgroup Problem and Eigenvalue Estimation on a Quantum Computer ”, in proceeding from the first NASA International Conference, Quantum Computing and Quantum Communications, volume 1509, 1999, pp. 174–188
1999
Cited alongside, same era.

M. Hirvensalo, “Quantum Computing” , 2nd edition, Natural Computing Series, Springer Verlag, 2004
2004
Later among the works it cites.
M. Ekerå, “Modifying Shor’s algorithm to compute short discrete logarithms” , in IACR ePrint Archive, report 2016/1128 , 2016
2016
Later among the works it cites.