|
|
|
|
|
by dyeje
5000 days ago
|
|
A lot of public key cryptography methods used in the real world are based on the fact that factoring really big numbers is computationally unfeasible. Shor's algorithm makes it feasible, but it's a quantum algorithm that can't be run on a classical computer. Basically, alot of stuff won't be secure anymore when it's feasible to run Shor's algorithm. |
|