News for hackers. Stuff that matters.
Re:Does a solution to the Riemann hypothesis render RSA encr... by godelmachine on Friday December 15, 2017 @05:33PM (#15935822)
Hi, I read on Wikipedia entry of "P versus NP problem" - if its proved that P=NP, then any kind of encryption can be broken. How true is that? Thanks.

There are no comments on this comment yet.