Skip to main content
1 of 2

RSA - Compare two values for encryption exponent, both are relatively prime and 𝑒 < λ(n)

So i have a question to answer and i am a bit stuck, i have looked around the forum and web.

So we have q = 311, p = 163, e = 101, I found d = 39281 using Euclidean Algorithm and checked by encrypting and decrypting a msg.

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

101 = prime

39281 = not prime ( 23 x 397)

Both options for e are relatively prime to (p - 1) * (q - 1)

both options for e satisfy 𝑒 < λ(n)

Are there any other things i need to consider for e to answer the question, hints preferred not a full answer!