RSA - Compare two values for encryption exponent, both are relatively prime and $e < λ(n)$ So we have $q = 311$, $p = 163$, $e = 101$, I found $d = 39281$ using Euclidean Algorithm and checked by encrypting and decrypting a message.

Next it is asking if $e = 101$ was a good choice or would the value $e = 9131$ be better.

What I know:


$101$ = prime
$39281$ = not prime ( $23 x\times 397$)


Both options for $e$ are relatively prime to $(p - 1) \cdot (q - 1)$ and both options for $e$ satisfy $ &lt; λ(n)$.

Are there any other things I need to consider for $e$ to answer the question? I have looked around the forum and web but I'm stuck right now.

Hints preferred not a full answer!
Hint: compute $d$ for the alternate value of $e$ considered. Isn't something rather remarkable? What is the probability that it occurs by chance?

While that is totally immaterial given that $p$ and $q$ are billions-n'-billions times too small to prevent factorization (gross understatement), what if we scaled things?  Why would it matter (caution: there are several levels of answer to that later one)?

Facts relevant to this (and many other sensible RSA questions) can be found by combing Dan Boneh's classic Twenty Years of Attacks on the RSA Cryptosystem (in Notices of the AMS, Vol. 46, No. 2, pp. 203-213, 1999).
I might have properly cited that followup attempt if it had acknowledged what inspired it.