No, they don't give rise to attacks because the lower bound of NP-complete algorithms) is monstrously huge. People tend to treat P as Omega(n^4) because all th

No, they don't give rise to attacks because the lower bound of NP-complete algorithms) is monstrously huge. People tend to treat P as Omega(n^4) because all the P algorithms they know are. But that's not because P is everywhere that small, it's because larger P algorithms are just as infeasible as O(e^n) in practical computers will ever be for human timespans, as long as you choose a reasonably large N, so they aren't studied much in practice.