Question

Perform encryption and decryption using the RSA algorithm, for the following p = 3, 9 = 11, e = 7 M = 5 What is the public ke
0 2
Add a comment Improve this question Transcribed image text
Answer #1

Solution:

Given,

=>RSA algorithm is used

=>p = 3, q = 11, e = 7 and M = 5

Explanation:

Calculaitng value of n:

=>n = p*q

=>n = 3*11

=>n = 33

Calculating value of \phi (n)(Euler totient of n):

=>\phi(n) = \phi (p)*\phi(q)

=>\phi(n) = (p-1)*(q-1)

=>\phi(n) = 2*10

=>\phi(n) = 20

Calculating value of d(decryption constant):

=>We know that we need to choose d such that e*d mod\phi(n) = 1

=>7*d mod 20 = 1

=>d = 3 as 7*3 mod 20 = 1

Calculating value of PU(public key):

=>Pair (e, n) represents public key

=>Public key = (7, 33)

Calculating value of PR(private key):

=>Pair (d, n) represents value of private key.

=>Private key = (3, 33)

Calcualting value of ciphertext C:

=>We know that, ciphertext(C) = M^e mod n where M is plaintext

=>C = 5^7 mod 33

=>C = 14

Converting ciphertext to plaintext(M):

=>We know that, plaintext(M) = C^d mod n where C is ciphertext

=>M = C^d mod n

=>M = 14^3 mod 33

=>M = 5

I have explained each and every part with the help of statements attached to it.

Add a comment
Know the answer?
Add Answer to:
Perform encryption and decryption using the RSA algorithm, for the following p = 3, 9 =...
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. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • This question tests your knowledge of encryption and decryption using the RSA method. the numbers in...

    This question tests your knowledge of encryption and decryption using the RSA method. the numbers in soled are deliberately chosen to be mall enough to focus on gown understanding without excessive calculations. Alice and Bob decide to use an RSA cryptosystem with public key (77, 13) for communication. Alice wants to send Bob the message m = 22. Determine Alice's ciphertext c. Determine Bob's private boy Carry out Bob's decryption of Aloe's ciphertext c, and compare his result with Alice's...

  • Question 2 (compulsory) (a) Explain the operation of the RSA public-key cryptosystem (b) Illustra...

    Question 2 (compulsory) (a) Explain the operation of the RSA public-key cryptosystem (b) Illustrate your explanation by using the prim es p 13 and q 17 and secret decryption key d 103 to (i) decrypt the ciphertext z2; (ii) compute the public encryption key e corresponding to d (ii) encrypt the plaintext m-. (c) Discuss the security of the RSA public-key cryptosystem Question 2 (compulsory) (a) Explain the operation of the RSA public-key cryptosystem (b) Illustrate your explanation by using...

  • O-8. (15 points) Bob's simple toy RSA eryptosystem has public key kyub(n, e) (65,5), where n =p,-...

    o-8. (15 points) Bob's simple toy RSA eryptosystem has public key kyub(n, e) (65,5), where n =p,-5x13-65 and e-5. I. Describe the key pair generation procedure for Bob to generate his private key kor- d. With the above given parameters, use EEA to calculate d 2. Describe RSA encryption procedure that Alice uses to encrypt her plaintext message x to its above given parameters, what will be y? ciphertext y before sending the message to Bob. Suppose Alice's message x-...

  • p=3, q=7 Suppose that Bob wants to create an example of an RSA public-key cryptosystem by using the two primes p ??? an...

    p=3, q=7 Suppose that Bob wants to create an example of an RSA public-key cryptosystem by using the two primes p ??? and q ???. He chooses public encryption key e He was further supposed to compute the private decryption key d such that ed 1 mod A(pq)). However, he confuses A and and computes instead d' such that ed' =1 (mod P(pq)). (i) Prove that d' works as a decryption key, even though it is not necessarily the same...

  • In a RSA cryptosystem, a participant A uses two prime numbers p = 13 and q...

    In a RSA cryptosystem, a participant A uses two prime numbers p = 13 and q = 17 to generate her public and private keys. If the public key of A is 35, then the private key of A is 11. Alice wants to encrypt a message to Bob by using the RSA algorithm and using keys in (A) The plaintext = “HI”. Answer: _______________

  • Computing RSA by hand. Let p = 13, q = 23, e = 17 be your...

    Computing RSA by hand. Let p = 13, q = 23, e = 17 be your initial parameters. You may use a calculator for this problem, but you should show all intermediate results. Key generation: Compute N and Phi(N). Compute the private key k_p = d = e^-1 mod Phi(N) using the extended Euclidean algorithm. Show all intermediate results. Encryption: Encrypt the message m = 31 by applying the square and multiply algorithm (first, transform the exponent to binary representation)....

  • Digital Signature (5-5): In the course notes we looked at RSA for encryption and signatures (using...

    Digital Signature (5-5): In the course notes we looked at RSA for encryption and signatures (using exactly the same mathematical formula), and ElGamal for encryption. There has been several questions on using ElGamal for signature. The ElGamal encryption algorithm cannot be used for signatures but there are signature schemes that is based on discrete logarithm. (a) Search for simple explanation of the ElGamal signature scheme and DSA signature scheme (Hint: Wikipedia). Can these algorithms be used to encrypt a message?...

  • 4. Suppose you wish to encrypt the message, M 42 using RSA encryption. Given a public...

    4. Suppose you wish to encrypt the message, M 42 using RSA encryption. Given a public key where p- 23 and q-11 and the relative prime e- 7. Find n, and show all necessary steps to encrypt your message (42). (Hint: check p.411 of the text for information on public key RSA) (5 points)

  • Problem 4. The plaintext P has been encrypted with RSA n = 65, e = 29...

    Problem 4. The plaintext P has been encrypted with RSA n = 65, e = 29 to yield the ciphertext C = 3 = P29 mod 65. Find P using the decryption key d, and prove the congruence class of P that solves this congruence is unique.

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT