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 asymp

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.