How Riemann hypothesis would break internet security?

Avichal
Messages
294
Reaction score
0
I saw this in one of the episodes of Numb3rs - (a T.V. show that describes how math can be used to solve crimes)
It basically said that if Riemann hypothesis is true then it could break all the internet security. I want to know how.
I couldn't understand Riemann hypothesis from Wikipedia and other sources so don't throw all the math at me.

P.S. :- I don't know under which forum this thread belongs. I couldn't find a number theory forum
 
Mathematics news on Phys.org
Avichal said:
I saw this in one of the episodes of Numb3rs - (a T.V. show that describes how math can be used to solve crimes)
It basically said that if Riemann hypothesis is true then it could break all the internet security. I want to know how.
I couldn't understand Riemann hypothesis from Wikipedia and other sources so don't throw all the math at me.

P.S. :- I don't know under which forum this thread belongs. I couldn't find a number theory forum

It's a TV show. For all practical purposes, the Riemann hypothesis IS true. It just hasn't been proved to be. There are computers out there trying to falsify it 24/7, and they haven't succeeded yet.

So if it could break internet security, that would have been done a long time ago.
 
FredericGos said:
It's a TV show. For all practical purposes, the Riemann hypothesis IS true. It just hasn't been proved to be. There are computers out there trying to falsify it 24/7, and they haven't succeeded yet.

So if it could break internet security, that would have been done a long time ago.

Ah, why would they show such a thing? I got so excited!
Yes if it was true then it would have been broken a long time ago ... didn't think of that
 
Avichal said:
Ah, why would they show such a thing? I got so excited!

Because it sounds cool. ;)
 
Avichal said:
I saw this in one of the episodes of Numb3rs - (a T.V. show that describes how math can be used to solve crimes)
It basically said that if Riemann hypothesis is true then it could break all the internet security. I want to know how.
I couldn't understand Riemann hypothesis from Wikipedia and other sources so don't throw all the math at me.

P.S. :- I don't know under which forum this thread belongs. I couldn't find a number theory forum

I believe this is a modern day math old-wives tale. It stems from the (beautiful) connection between prime numbers and the zeros of the zeta function:

\psi(x)=-\frac{1}{2\pi i} \mathop\int\limits_{\gamma-i\infty}^{\gamma+i\infty} \frac{\zeta'(s)}{\zeta(s)}\frac{x^s}{s} ds

That's primes on the left and zeros on the right. Riemann conjectured that the conjugate zeros of the zeta function all have real part equal to 1/2 (Re(z)=1/2).

Now, one of the most hack-proof security systems used today on computers relies on the RSA algorithm which involves factoring very large numbers: if you know the prime factors, you can compute the number but if you know only the number, very hard to find it's factors if it's a product of two very large primes.

So that if the Riemann hypothesis is proven, someone will have shown indeed the conjugate zeros are all on the line Re(z)=1/2. However, this information will do nothing towards finding the prime factors of an RSA number.
 
Last edited:
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top