One functions are easy to compute (ie polynomial time checking) but hard to reverse. if P = NP does that mean that asymmetric key exchanges will be reduced from polynomial computation time and exponential inversion time to polynomial computation time and "worse" polynomial inversion time.
If P = BQP can there still be secure asymmetric key exchanges using quantum computers?