not much will change other than knowing that some forms of cryptography are more secure. if it had been false, things would have changed much more drastically
Isn't it the other way around? We know cryptography is as secure as designed with the RH assumed true. If it were not true (primes are random), things would be a little more secure?
It implies that the Miller primality test runs in polynomial time. (Though I think this already followed from the weaker result OpenAI proved last month.) Anything that depends on "how likely is it a random number is a prime" depends on the truth or falsity of the Riemann hypothesis.