3 ms·
They cover that in the article: > Quantum computing of the sort intended to break RSA involves a breakthrough in both computing and algorithms. Normally some s
by nailer 3y ago
They cover that in the article:
> Quantum computing of the sort intended to break RSA involves a breakthrough in both computing and algorithms. Normally some sort of new computing technology is invented and then algorithms are designed to enable that technology to do something useful. The quantum computing threat to RSA is different. We now have the algorithm (Shor's) but the computer to run it on only exists in our imagination.
> If someone were to invent such a computer then RSA 2048 would be immediately and trivially breakable. RSA 3072 would also be trivially breakable. The same applies to RSA 4096 and 8192.
- roomey 3y agoThey can't know that however, they may say it but they can't know it. Hence why not choose key lengths by looking at encoding and decoding resource usage instead of crackability. By costs nothing I mean as CPUs get faster there is less performance impact on lenghtening keys
- nailer 3y agoThey already are, hence everyone moving to ED25519 (which uses less CPU for the equivalent key strength) instead of RSA.