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?
$\begingroup$
$\endgroup$
6
-
$\begingroup$ This is the exact dupe : In RSA encryption, why does the public exponent (usually, 'e') have to be coprime with $\varphi(n)$? $\endgroup$– kelalakaCommented Aug 27, 2020 at 8:52
-
2$\begingroup$ Actually, the crypto.stackexchange.com/questions/81949/… answer addresses the specific question Yolo asked $\endgroup$– ponchoCommented Aug 27, 2020 at 13:32
-
$\begingroup$ This answer was moved here since it fits that other question well. $\endgroup$– fgrieu ♦Commented Aug 27, 2020 at 16:48
-
$\begingroup$ @poncho The answer was moved, you could copy above comment there if you want, as the mods seemingly cannot. $\endgroup$– Maarten Bodewes ♦Commented Aug 27, 2020 at 18:46
-
$\begingroup$ 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? $\endgroup$– fgrieu ♦Commented Aug 27, 2020 at 21:21
|
Show 1 more comment