I've watched a lot of videos on Shor's Algorithm and Quantum Computers. Most of these videos say these two things undermine RSA via fast-factoring, but they never really explain how fast-factoring is used to these break things; just very hand-wavy statements.
Basically:
- I get that with fast factoring, you could(?) reconstruct the private key from a public key. But wouldn't you still need the username/password/server details? I've ssh'd into servers for work and I still have to provide credentials on top of the ssh keys. Various commands on the server are also password protected, so fast-factoring doesn't seem all that dangerous unless I'm missing something here.
- I get that MITM can use fast-factoring to decrypt the traffic (via the trick above) allowing you to modify the traffic then re-encrypt.
I guess I have not seen/read a complete start-to-finish example story of how fast-factoring would actually undermine the internet.