Quantum Algorithms for Integer Factorization
Quantum Algorithms for Integer Factorization
S. Yan
2015 · DOI: 10.1007/978-3-319-25823-2_3
2 Citations
TLDR
If IFP can be solved in polynomial-time, then RSA and many other cryptographic systems can be broken completely and efficiently.