# How to decrypt c when phi(n) and e are not relatively prime [duplicate]

I have read multiple websites to see what would happen with RSA when $$\phi(n)$$ and $$e$$ are not relatively prime, but no one has discussed it.

Can someone explain how to decrypt $$c$$ if $$\phi(n)$$ and $$e$$ aren't relatively prime?

• Aug 27 '20 at 8:52
• Regarding Can someone explain how to decrypt $c$ if $n$ is prime, and $\phi(n)$ and $e$ aren't relatively prime?: have you checked poncho's answer which has a large intersection with your case?