Asymmetric cryptographic algorithms

Is it possible for any of them to survive to P=NP, assuming that NP-complete O(2^N) problems collapse to at best O(N²)?

>>7
I know, but I don't know any asymmetric cryptographic algorithm that relies on an EXPTIME-complete problem (actually, I don't know many problem in EXPTIME other than chess, go, and other board games, but that's my lack of education), so if P=NP all of them would break.