Enhanced Scalability in Assessing Quantum Integer Factorization Performance

Lévy, P., & Pellegrino, F. (1951). Problémes concrets d’analyse fonctionnelle

Original

1951

Earlier work this paper cites.

Rivest, R. L., Shamir, A., & Adleman, L. (1978). A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2), 120-126

1978

Earlier work this paper cites.

Shor, P. W. (1994). Algorithms for quantum computation: discrete logarithms and factoring. In Proceedings 35th annual symposium on foundations of computer science (pp. 124-134). Ieee

1994

Earlier work this paper cites.

Grover, L. K. (1996). A fast quantum mechanical algorithm for database search. In Proceedings of the twenty-eighth annual ACM symposium on Theory of computing (pp. 212-219)

1996

Earlier work this paper cites.

Shor, P. W. (1999). Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM review, 41(2), 303-332

1999

Earlier work this paper cites.

Dworkin, M. J., Barker, E. B., Nechvatal, J. R., Foti, J., Bassham, L. E., Roback, E., & Dray Jr, J. F. (2001). Advanced encryption standard (AES)

2001

Cited alongside, same era.

Vidal, G. (2003). Efficient classical simulation of slightly entangled quantum computations. Physical review letters, 91(14), 147902

2003

Cited alongside, same era.

Gerjuoy, E. (2005). Shor’s factoring algorithm and modern cryptography. An illustration of the capabilities inherent in quantum computers. American journal of physics, 73(6), 521-540

2005

Cited alongside, same era.

Grassl, M., Langenberg, B., Roetteler, M., & Steinwandt, R. (2016). Applying Grover’s algorithm to AES: quantum resource estimates. In International Workshop on Post-Quantum Cryptography (pp. 29-43). Cham: Springer International Publishing

2016

Cited alongside, same era.

Jordan, S. P., & Liu, Y. K. (2018). Quantum cryptanalysis: shor, grover, and beyond. IEEE Security & Privacy, 16(5), 14-21

2018

Later among the works it cites.

Jiang, S., Britt, K. A., McCaskey, A. J., Humble, T. S., & Kais, S. (2018). Quantum annealing for prime factorization. Scientific reports, 8(1), 17667

2018

Later among the works it cites.

Bonnetain, X., Naya-Plasencia, M., & Schrottenloher, A. (2019). Quantum security analysis of AES. IACR Transactions on Symmetric Cryptology, 2019(2), 55-93

2019

Later among the works it cites.

Jeong, K. (2023). Sample-size-reduction of quantum states for the noisy linear problem. Annals of Physics, 449, 169215

2023

Closest in time.