[robot_no_421]

Yes, in the sense that if P = NP, it would conceptually be a lot easier in theory to break a lot of public key encryption, which are NP hard problems.