I don't have the background for dealing with Riemann hypothesis but is well known that covers the prime distribution below a specified number.
In order to solve the RSA problem you have to factor the semiprime or calculate the totient itself, that's hard as factoring the modulus.
Question is, could Riemann hypothesis be used to calculate how many coprimes are below the modulus by counting the primes below $n$ and also counting how many products of those primes are below $n$, except those involving $p$ and $q$?
If the previous is negative, can someone clarify why some people say that Riemann hypothesis could "break" RSA?
Thanks for your patience and comprehension.