I didn't refer any literature but thought this was ideal to get views from people here..
Assuming that P=NP is proved would cryptography(only provable security) be impossible? Since the adversary can break any scheme in polynomial time.
Aren't the NP-hard problems enough to save the day? I've heard of crypto-systems based on "subset problems". Since P=NP would not affect the nature of NP-hard problems.
It would also be great if can suggest any interesting articles regarding this..
P.S: Please feel free to edit if you find any naive statements in the question.