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²)?

>>2
Um, what?

>>4
Please submit them to /prog/ peer review.

>>6
I meant, algorithms other than those that rely on factorization or the discrete logarithm problem.