[moi2388]

In principle a proof of the Riemann Hypothesis could give you information about the distribution of primes and could possible make it easier to test for primality, in the worst case breaking modern encryption.

But that’s a lot of what ifs away.

[Ar-Curunir]

There is no known result that says RH being true breaks modern encryption; if there was, the cryptanalysts would assume RH and try to break it anyway.

[IsTom]

Not RH being true, but that the proof itself would require discovering and proving something of high interest as an intermediate step.

[Ar-Curunir]

Perhaps, but it’s not clear that would be cryptographically relevant still.

[Ar-Curunir]

Testing primality doesn’t break encryption; we already test for primarily on a daily basis very efficiently

[moi2388]

My apologies, that is not what I meant. I meant that the proof might break encryption. Again, might. As response to a list of possible real-world implications as the reader asked for.