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.
[ Parent
| on HN ]