Skip to main content
Cryptography

Return to Question

polish
Source Link
kelalaka
kelalaka
  • 49.5k
  • 12
  • 119
  • 205

From what I understand, we can arbitrarily choose an exponent e as long as $pgc (e,\phi(n)) =1$$\gcd(e,\phi(n)) =1$. But what is the most appropriate choice for it? Should it be small compared to $\phi(n)$ or approach it?

  • But what is the most appropriate choice for it?
  • Should it be small compared to $\phi(n)$ or approach it?

From what I understand, we can arbitrarily choose an exponent e as long as $pgc (e,\phi(n)) =1$. But what is the most appropriate choice for it? Should it be small compared to $\phi(n)$ or approach it?

From what I understand, we can arbitrarily choose an exponent e as long as $\gcd(e,\phi(n)) =1$.

  • But what is the most appropriate choice for it?
  • Should it be small compared to $\phi(n)$ or approach it?
Source Link
Blumer
Blumer
  • 33
  • 4

Appropriate public exponent choice for RSA encryption

From what I understand, we can arbitrarily choose an exponent e as long as $pgc (e,\phi(n)) =1$. But what is the most appropriate choice for it? Should it be small compared to $\phi(n)$ or approach it?