2 ms·
Classical computers take a polynomial amount of time (in key size) to perform RSA but exponential amount of time (in key size) to break RSA. Quantum computers c
by UncleMeat 9y ago
Classical computers take a polynomial amount of time (in key size) to perform RSA but exponential amount of time (in key size) to break RSA. Quantum computers can break RSA in polynomial time.
For classical systems, the cost to break RSA grows much faster than the cost to perform it, so we can always outpace more powerful adversaries with a less powerful computer. This is not true for quantum machines. I cannot produce a key size that will be small enough that I can work with it but large enough that it is secure against attack.