No, and I’ll give you my best understanding based on what limited math I have. Basically, the Reimann hypothesis says the Reimann zeta function follows a specific pattern. It doesn’t really matter what the zeta function is or what the exact pattern is for cryptography, just that it has implications for the distribution of prime numbers.
We already know about the structure of prime distribution to an extent. Just go through in your head marking off multiples of each prime, 2 takes out all the even numbers, 3 reduces possible primes from there, 5… and so on. This just puts a sort of bound on how far down the line you need to search for the next prime.
The strength of RSA (and any integer factorization crypto scheme) is based on the difficulty of finding two primes that multiply to a specific number. This proof does not make that search any easier. It may reveal how the primes are distributed within the possible key space, i.e., think about all the numbers from 0 to 2^1024, how far do we need to search to find a prime in that search space? But the underlying security of RSA remains strong.
Gotcha thank you. It’s been a long time since I studied cryptography and I really never studied higher math properly so NGL my brain just went, oh, new discovery that could make finding primes more computationally trivial… RSA?
I guess the real test of if this is useful is if Claude just effectively cracked RSA? Would be big news.
No, and I’ll give you my best understanding based on what limited math I have. Basically, the Reimann hypothesis says the Reimann zeta function follows a specific pattern. It doesn’t really matter what the zeta function is or what the exact pattern is for cryptography, just that it has implications for the distribution of prime numbers.
We already know about the structure of prime distribution to an extent. Just go through in your head marking off multiples of each prime, 2 takes out all the even numbers, 3 reduces possible primes from there, 5… and so on. This just puts a sort of bound on how far down the line you need to search for the next prime.
The strength of RSA (and any integer factorization crypto scheme) is based on the difficulty of finding two primes that multiply to a specific number. This proof does not make that search any easier. It may reveal how the primes are distributed within the possible key space, i.e., think about all the numbers from 0 to 2^1024, how far do we need to search to find a prime in that search space? But the underlying security of RSA remains strong.
Gotcha thank you. It’s been a long time since I studied cryptography and I really never studied higher math properly so NGL my brain just went, oh, new discovery that could make finding primes more computationally trivial… RSA?
Maybe disproving the hypothesis would weaken some crypto but it has nothing to do with factoring primes. It’s about the distribution of primes.
No. I don’t think you understand what GRH is.
If anything the proof helps cryptography.
“I don’t think you understand what GRH is” and then proceeded to not explain what it is.
Why are you putting the burden to explain it on OP? He just pointed out the error in thinking this weakens encryption.