Re:Does a solution to the Riemann hypothesis render RSA encr...
by YomiK on Sunday December 17, 2017 @03:51AM
(#15944881)
This is incorrect.
"prime numbers would be too easy to find" -- they're already really easy to find. Factoring large semiprimes is currently hard. Primality testing and finding primes for RSA keys is very easy. If the RH was proven true, it wouldn't speed that up in any practical way either.
As an experiment, assume the Riemann Hypothesis. Does that make factoring easier? No. Do we have any currently known methods of weakening RSA if the RH was true? No.
"prime numbers would be too easy to find" -- they're already really easy to find. Factoring large semiprimes is currently hard. Primality testing and finding primes for RSA keys is very easy. If the RH was proven true, it wouldn't speed that up in any practical way either.
As an experiment, assume the Riemann Hypothesis. Does that make factoring easier? No. Do we have any currently known methods of weakening RSA if the RH was true? No.
For some actual consequences of the RH: https://mathoverflow.net/questions/17209/consequences-of-the...