# how to use common modulus attack?

I am struck with the following problem:

Let Alice, Bob, Chris and Eve communicate over a public network. They encrypt all messages they send using RSA system. Bob and Chris have the RSA modulus $n_B$ and $n_C$ respectively with $n_B$ = $n_C$ But different public encryption exponents: $e_B \neq e_C$. Suppose $\gcd(e_B, e_C)=1$, and that Alice sends the same secret message to Bob and Chris.

Show how Eve can decipher the message.

-
Didn't realize RSA had this property. Even though this is a low effort question, +1 for making be learn something new. –  CodesInChaos May 20 '14 at 18:31
This is not a homework-answering or exercise-solving service. We want to help you, but we can't do that if you haven't shown us what you have tried. So, I suggest you edit the question to show us what you have tried and where you got stuck. Finally, make sure you give proper attribution to the source where you copied this from. –  D.W. May 22 '14 at 22:47

Think about this: what does it mean that $\gcd(e_B, e_C)=1$. Formally that means there exist some $s_1, s_2$ such that $e_Bs_1 + e_Cs_2=1$.
Say you have two ciphertexts (the following math is all done modulo the shared modulus), $C_B=M^{e_B}$ and $C_C=M^{e_C}$. You can do the following:
\begin{align} C_B^{s_1}*C_C^{s_2}&=(M^{e_B})^{s_1}*(M^{e_C})^{s_2}\\ &=M^{e_Bs_1}*M^{e_Cs_2}\\ &=M^{e_Bs_1+e_Cs_2}\\ &=M^1\\ &=M \end{align}
@Sara The ciphertext is raised to the $s_1$ and $s_2$ respectively, which multiplies in the exponent. –  mikeazo May 30 '14 at 14:54