special public keys and modulo n
1) Yes. This is the common modulus attack and has actually been answered many times on this forum.

2) Assuming $r$ is prime, yes. $\phi(n)$, (the totient of $n$) can be computed by subtracting 1 from each of $n$'s prime factors and multiplying them together.