News for hackers. Stuff that matters.
Re:A Solution of the P versus NP Problem? by legulere on Monday August 14, 2017 @07:19PM (#15013905)
Would it present a problem for cryptography though? Quadratic algorithms are seen as already slow, cubic algorithms as unbearable garbage you best try to avoid if your data size is not tiny. And this completely ignores constant factors that can play a big role. Homomorphic encryption for instance fails to be usable just on a huge constant factor.
Re:A Solution of the P versus NP Problem? by Ar-Curunir on Monday August 14, 2017 @08:25PM (#15014311)
Yes, it would. The adversary in cryptography is assumed to be worst-case evil; it'll do whatever it can to break your algorithm, as long as it's performing a polynomial amount of computation. Remember, you're not just fighting your friendly neighborhood hacker, but possibly entire nation-states.
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.
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.