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

>>10
There are asymmetric cryptography algorithms that are thought to be not in BQP. I don't remember any keywords though.

However it seems that P=NP breaks all asymmetric algorithms, because you can basically check all possible private keys to see if any matches the public key (and signature) as fast as you can decrypt/verify with a single key.