I need help with this assignment 3) Perform encryption and decryption using the RSA algorithm given the following: p=47; q=59, e=17; M=11
Added by Michelle W.
Step 1
Calculate n = p*q n = 47*59 = 2773 Show more…
Show all steps
Your feedback will help us improve your experience
Corbin Tegner and 54 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
10. (RSA Cryptography) Let p = 47, q = 59, N = pq = 2773, and e = 157. (a) Compute a multiplicative inverse of e modulo Φ(N). (b) Every two-letter string (including A-Z and spaces) can be digitized into a number between 0 and 2626 by letting space=00, A=01, B=02, etc. For example, the two-letter word "Me" becomes 1305. Encrypt the two-letter message "Hi" by computing it's digitization m, and the ciphertext m^e (mod N). (c) Decrypt the sequence of ciphertexts 0802, 2179, 2657, 1024 to find a message.
Sri K.
Problem 8 [8 points]. Consider the RSA modulus m = 1189, and notice that 29 | m. a. [5 points] If the encryption exponent is e = 747, what is the decryption exponent d? b. [3 points] Keeping the same encryption exponent e = 747 from (a), suppose that you are sent the following ciphertext, i.e., encrypted message: 763 : 459 : 334 : 763 : 766 Decrypt this message to determine the plaintext message in numerical form, showing your work. Then translate it into word(s) using the following convention: A 0 B 1 C 2 D 3 E 4 F 5 G 6 H 7 I 8 J 9 K 10 L 11 M 12 N 13 O 14 P 15 Q 16 R 17 S 18 T 19 U 20 V 21 W 22 X 23 Y 24 Z 25
Let p = 23 and q = 17, please follow the RSA key setup steps nad perform the following: (Please show your calculation process to get partial credits) Calculate the value n = p*q and φ(n) For the selected value e = 65, verify that gcd(e, φ (N)) = 1 Compute the multiplicative inverse d (mod φ(n) ), i.e. compute d (1 < d < φ(n) ) such that e*d mod φ(n) = 1 For plaintext m = 100, calculate the ciphertext c = m^e mod n
Madhur L.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Watch the video solution with this free unlock.
EMAIL
PASSWORD