Skip to main content
added 38 characters in body
Source Link
Maarten Bodewes
  • 94.5k
  • 13
  • 165
  • 319

RSA - Compare two values for encryption exponent, both are relatively prime and 𝑒$e < 位(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$q = 311$, p = 163$p = 163$, e = 101$e = 101$, I found d = 39281$d = 39281$ using Euclidean Algorithm and checked by encrypting and decrypting a msgmessage.

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

101 = primeWhat I know:

39281 = not prime ( 23 x 397)

  • $101$ = prime

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

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

$(p - 1) \cdot (q - 1)$ and both options for e$e$ satisfy 饾憭 < 位(n)$饾憭 < 位(n)$.

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

Hints preferred not a full answer!

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!

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 $饾憭 < 位(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!

Source Link

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!