Ok so I have heard in all sorts of places that Riemmans hypothesis has very important uses in cryptography. I have heard in many places that if someone solved it he would be able to hack various encryption systems and stuff like that.
My question is bipartite. In the first place. I read in wikipedia that the Riemann hypothesis states that the non trivial roots of the Riemman zeta function have real part 1/2. Could someone explain how this helps in finding primes.
In the second place: why does someone need to prove it to be able to use it? I mean, cant somebody assume its true and use it without the proof? Thank you all vary much in advance.