3 ms·
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] h
by QML 8y ago
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 https://en.wikipedia.org/wiki/AKS_primality_test
- mtzet 8y agoWhile 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.