Skip to main content
Cryptography

Return to Question

Rollback to Revision 2
Source Link
kelalaka
kelalaka
  • 49.5k
  • 12
  • 119
  • 205

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

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

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

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

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?

added 35 characters in body
Source Link
Yolo
Yolo
  • 21
  • 1
  • 5

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

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

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?

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

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

4
duplicates list edited from RSA: How to compute the number of possible plaintexts if $e$ is not coprime to $\varphi(n)$?, In RSA encryption, why does the public exponent (usually, 'e') have to be coprime with $\varphi(n)$?, How to compute $m$ value from RSA if $phi(n)$ is not relative prime with the $e$? to RSA: How to compute the number of possible plaintexts if $e$ is not coprime to $\varphi(n)$?, In RSA encryption, why does the public exponent (usually, 'e') have to be coprime with $\varphi(n)$?, How to compute $m$ value from RSA if $phi(n)$ is not relative prime with the $e$?
Link
fgrieu ♦
fgrieu ♦
  • 145.6k
  • 12
  • 319
  • 611
3
duplicates list edited from In RSA encryption, why does the public exponent (usually, 'e') have to be coprime with $\varphi(n)$?, How to compute $m$ value from RSA if $phi(n)$ is not relative prime with the $e$? to RSA: How to compute the number of possible plaintexts if $e$ is not coprime to $\varphi(n)$?, In RSA encryption, why does the public exponent (usually, 'e') have to be coprime with $\varphi(n)$?, How to compute $m$ value from RSA if $phi(n)$ is not relative prime with the $e$?
Link
fgrieu ♦
fgrieu ♦
  • 145.6k
  • 12
  • 319
  • 611
Post Closed as "Duplicate" by kelalaka, ckamath, poncho rsa
polish
Source Link
kelalaka
kelalaka
  • 49.5k
  • 12
  • 119
  • 205

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

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

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?

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?

Source Link
Yolo
Yolo
  • 21
  • 1
  • 5