News for hackers. Stuff that matters.
Re:Mathematician-M.D. claims to have solved the 110-year-old... by QML on Thursday June 28, 2018 @02:24AM (#17414524)
We already have polynomial-time algorithm for primality testing [1]; not sure if a proof of the Riemann Hypothesis will affect cryptography by that much.

[1] https://en.wikipedia.org/wiki/AKS_primality_test

Re:Mathematician-M.D. claims to have solved the 110-year-old... by mtzet on Thursday June 28, 2018 @04:56AM (#17415176)
While I agree that a proof of the Riemann hypothesis is unlikely to matter for cryptographical purposes, neither does the AKS primality test. As with many asymptotically efficient algorithms, the constants are simply too large for it to be practical.