# 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?

• – kelalaka Aug 27 '20 at 8:52
• Actually, the crypto.stackexchange.com/questions/81949/… answer addresses the specific question Yolo asked – poncho Aug 27 '20 at 13:32
• This answer was moved here since it fits that other question well. – fgrieu Aug 27 '20 at 16:48
• @poncho The answer was moved, you could copy above comment there if you want, as the mods seemingly cannot. – Maarten Bodewes Aug 27 '20 at 18:46
• 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? – fgrieu Aug 27 '20 at 21:21