News for hackers. Stuff that matters.

A comment on Factoring may be easier than we think (2016). Parent comment

Re:Factoring may be easier than we think (2016) by gshubert17 on Sunday June 30, 2019 @07:19PM (#20321214)
Author Charles Stross explored a similar question in his short story "Antibodies": what happens to encryption or machine intelligence when the proof that P == NP is published?

https://www.antipope.org/charlie/blog-static/fiction/toast/t...

[ Parent | on HN ]
Re:Factoring may be easier than we think (2016) by empath75 on Sunday June 30, 2019 @08:28PM (#20321506)
Nothing if it’s non constructive.
[ Parent | on HN ]
Re:Factoring may be easier than we think (2016) by DoctorOetker on Monday July 01, 2019 @04:25PM (#20329380)
... in the case of a non constructive proof, there would still be a significant change: it would dramatically ramp up the search for a constructive proof
[ Parent | on HN ]