1. Other
  2. Other
  3. 7 20 pts a rsa encryption let n pq 717...

Question: 7 20 pts a rsa encryption let n pq 717...

Question details

7. (20 pts) a. RSA encryption. Let n pq (7)(17) 119 and e 5 define a (very modest) RSA public key encryption. Since 25 < 119 < 2525, we can only encode one letter (two digit representation) at a time. Use the function C = Me mod n to encode the word TRAP into a series of four numbers that are less than n A 0 C2 D13 H17 K 10 し 11 M | 12 N 13 O 14 P 15 a 16 R 17 S 18 T 19 U 20 V21 W 22 X123 Y 24 2 25 To decrypt an RSA encrypted message, we need to find d, the multiplicative inverse ofe modulo (p-1)(q-1). Use Euclidian algorithm and two-pass method to determine the Bezout coefficient of e for the RSA in Part a. above. Then write down the decryption function. b.

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution