special public keys and modulo n I just picked up cryptography and have some questions on RSA cryptosystem:


Say there are two public keys (n, e1), (n, e2), e1 is coprime to e2. They share the same n. Is it possible to find the plaintext if both of them encrypt the same message if I have both 2 public keys and 2 ciphertexts?
Usually, we use two primes p, q to construct modulo n = pq. I am wondering if we change n to pqr....... which is the multiplication of more than two primes, is the phi(n) equal to (p-1)(q-1)(r-1)..... and nothing else need to be changed to make RSA still work?
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.