News for hackers. Stuff that matters.

A comment on A Solution of the P versus NP Problem?. Parent comment

Re:A Solution of the P versus NP Problem? by PeterisP on Tuesday August 15, 2017 @02:13AM (#15015933)
You can easily have crypto that can't be broken with all the resources and time in the observable universe even if it's "just" polynomial with a sufficiently high coefficient.
[ Parent | on HN ]
Re:A Solution of the P versus NP Problem? by kevincox on Tuesday August 15, 2017 @03:40PM (#15021613)
Yes, but it becomes significantly more expensive. It might work but it is a huge difference in cost tradeoffs.
[ Parent | on HN ]