Name: Anonymous 2009-09-27 13:55
So as I understand it, quantum computers solve all NP problems in polynomial time. This means all encryption based on the distinction between P and NP, RSA being the most prominent, will be rendered useless.
My question is, are all public-key private-key algorithms rendered invalid? Could there possibly exists some algorithm that exploits the separation between, say, NP and PSPACE?
My question is, are all public-key private-key algorithms rendered invalid? Could there possibly exists some algorithm that exploits the separation between, say, NP and PSPACE?