What does Riemann's hypothesis have to do with encryption?

In the TV show "Numb3rs" , episode Prime Suspect , they describe that Riemann's hypothesis, if solved, would give great insight to internet encryption. They say that R's hypothesis predicts where prime numbers are, and encryption depends on the fact people do not know where they are (in other words, once solved, we can know what and where prime numbers are, rendering encryption's foundation worthless)

Is that theoretically true? If so, does that mean there is no such thing as encryption & protection if Riemann's hypothesis (or whatever encryption depends on) is fully understood?

Or, are there measures against such events? Is asymmetrical encryption designed for this purpose (maintaining the integrity of security even if the foundation was solved)?

Does the show accurately explain these concepts?

2011-06-17T12:20:13Z

"Riemann's hypothesis does not facilitate the factorization of composite numbers (which is required for some types of encryption). "

Is the method and means of factorization the key secret to disabling or decoding encryption?

Anonymous2011-06-23T14:14:10Z

The above answer is right, although I am not an expert but have read a lot about it. In principle, if RH is solved to be true, then it only confirms that the distributions of zero's of the complex function is indeed as stated by Riemann. These zeros are connected to the distrubutions of the 'real' primes, but finding the zero's and the primes one by one will still mean using a slow algorithm probably not far from the Sieve of Erathosthenes, so in other words, there still won't be a quick way to find prime number 2910 for instance, nor will it be possible to find quickly that the number 21 can be factorized by 3 and 7 (for big numbers I mean).
But, as I asked the same question to a guru in this field, Terence Tao, he said that the transformative power of a proof itself, that could indeed show RH to be true or not, might just do amazing things, so who knows.

00

Phat Daddy2011-06-17T06:17:30Z

Riemann's hypothesis does not facilitate the factorization of composite numbers (which is required for some types of encryption). The hypothesis "corrects" the error term for the current estimation of distribution of primes. Further, it is not a matter of "solving" RH which suggests it is some sort of high school algebra problem. Rather, it is proving (or disproving) the conjecture that the RH proposes; namely the location of the zeros of the Zeta function. Besides, if the RH could be used in the manner you are worried about you would not need a "proof" of it. Many constructs or theorems in mathematics are created assuming the RH is true. Some have suggested that the RH is, in fact, undecidable which is an even deeper and more squiggly can of worms.

00

Anonymous2016-11-02T06:46:40Z

Numb3rs Prime Suspect

00

Related Questions

How would mathematics, and the world at large, be changed if a proof was offerred for the Riemann Hypothesis?What is the real difficulty to solve Riemann Hypothesis problem?RIEMANN HYPOTHESIS, GOLDBACH CONJECTURE OR MERSENNE PRIMES - HELPP!!!?How does the Riemann hypothesis have the potential to change the current understanding of mathematics?What are some of the more current and useful encryption methods available to the common user?

Trending Questions

Finding Derivative of a Point?4 answersHow far is a 5k?14 answersHow do I solve 15^x-8+5=62 And round 3 places past the decimal?7 answers4^x-2=3 How do I solve this and round my answer 3 places past the decimal?6 answersThe sides of a triangle are in the ratio of 1/2:1/3:1/4. If the perimeter is 52 cm, the length or the smallest side is?5 answers