Many heuristics in cryptanalysis rely on heuristics widely believed about the distribution of prime numbers. If RH is proved, some of these heuristics would bec

Many heuristics in cryptanalysis rely on heuristics widely believed about the distribution of prime numbers. If RH is proved, some of these heuristics would become theorems. It would not, however, give practicing cryptanalysts new tools since belief in RH (and some even stronger conjectures!) are already baked in to the current toolbox.