Question

You want to encrypt a message using RSA using your private key of d=3,n=35. Your message...

You want to encrypt a message using RSA using your private key of d=3,n=35. Your message is 15. What is your ciphertext?

Homework Answers

Answer #1

In RSA,

-----------------------------------------------------------------------------------

In this question:

Message = m = 15

private key d=3, n=35

Encryption:

Since n = 35, and

we must guess two prime numbers p and q such that their product is 35.

Its easy since n is small number, we can guess, 5 and 7 are prime numbers and their product is 35.

p = 5, q = 7

For the given data, we cannot find e in range (1, 24) such that d*e mod 24 =1 ,

please check if the data is correct in the question. Are you sure if d = 3?

If we can find e, we can easily find the ciphertext,  using  

-------------------------

please check if the data is correct in the question. Are you sure if d = 3?

Please comment on this answer. for discussion

-------------------------

n = = p*q (where p and q are prime numbers)

We were unable to transcribe this image

We were unable to transcribe this image

We were unable to transcribe this image

We were unable to transcribe this image

We were unable to transcribe this image

n = = p*q (where p and q are prime numbers)

We were unable to transcribe this image

We were unable to transcribe this image

We were unable to transcribe this image

We were unable to transcribe this image

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Discrete Math In this problem, we will implement the RSA algorithm to encrypt and decrypt the...
Discrete Math In this problem, we will implement the RSA algorithm to encrypt and decrypt the message ”148”.For this exercise, you may want to use some kind of calculator that can compute the mod function. 1. Set the primes p and q as follows:p=31 and q=47. What are the values for N and φ? 2.The value for e is chosen to be 11. Use Euclid’s algorithm to verify that e and φ are relatively prime and to find d, the...
Bob has an RSA public key of (n, e) = (1363, 87) (a) What is Bob’s...
Bob has an RSA public key of (n, e) = (1363, 87) (a) What is Bob’s private key? (b) Bob receives the ciphertext which has been encrypted with his public key 893, 1265, 406, 171, 980, 1040, 12, 1152, 573 Decrypt the message. (You can use an appropriate package such as Matlab or Wolfram Alpha to do the calculations)
Let p=11, q=17, n = pq = 187. Your (awful) public RSA encryption key is (e=107,...
Let p=11, q=17, n = pq = 187. Your (awful) public RSA encryption key is (e=107, n=187). (a) What is your private decryption key? (b) You receive the encrypted message: 100 Decrypt the message. (In other words, what was the original message, before it was encrypted? Just give me a number, don’t convert it to letters).
You and I want to communicate using RSA. I have found a “large” prime for us...
You and I want to communicate using RSA. I have found a “large” prime for us to use, n=33 (3*11). a) Calculate the totient and come up with the smallest possible private key that will work. Justify that this private key is good (point out what has to be true). b) Calculate the associated public key. Start at least by writing down what has to be true for a value to be the public key. c) What are your public...
RSA Cryptography Perform encryption and decryption to find private decryption key d. a. p = 3,...
RSA Cryptography Perform encryption and decryption to find private decryption key d. a. p = 3, q = 13, e = 7 b. p = 787, q = 631, e = 234559
Let p=3 and q=17 and let an RSA public-key cryptosystem be given. 1. Why is the...
Let p=3 and q=17 and let an RSA public-key cryptosystem be given. 1. Why is the number 8 not a valid encryption-key? 2. We encrypt the number M=8 with the help of the encryption-key e=3. Why is the encrypted message C=2? 3. Why is the decryption key d for the encryption-key, (e=3), equal to 11? https://en.wikipedia.org/wiki/RSA_(cryptosystem)#Encryption
Alice is sending message “HIDE” to Bob. Perform encryption and decryption using RSA algorithm, with the...
Alice is sending message “HIDE” to Bob. Perform encryption and decryption using RSA algorithm, with the following information: Parameters p q e 11 5 7 Present all the information that you will need to encrypt and decrypt only the first letter from text.
Using One-Time Pad Encryption, encrypt the message "JELLO" with one time pad key "YMCKM". Use the...
Using One-Time Pad Encryption, encrypt the message "JELLO" with one time pad key "YMCKM". Use the resultant cipher (from above step) and the one time pad key (pre-shared "YMCKM") to get the plain text.
In an RSA system, the public key of a given user is e = 31, n...
In an RSA system, the public key of a given user is e = 31, n = 3599. What is the private key of this user?
For solving the problems, you are required to use the following formalization of the RSA public-key...
For solving the problems, you are required to use the following formalization of the RSA public-key cryptosystem. In the RSA public-key cryptosystem, each participants creates his public key and secret key according to the following steps: ·       Select two very large prime number p and q. The number of bits needed to represent p and q might be 1024. ·       Compute                n = pq                           (n) = (p – 1) (q – 1). The formula for (n) is owing to...