I don't know why this was downvoted. Even if P!=NP there are still other assumptions of hardness baked into modern cryptography which might turn out false. The

I don't know why this was downvoted. Even if P!=NP there are still other assumptions of hardness baked into modern cryptography which might turn out false. The abelian hidden subgroup problem (which both RSA and elliptic curves are instances) may turn out to have a classical solution.