8. (20 pts) a. RSA encryption. Let n = pq = (7)(17) = 119 and e...

8. (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 ? = ? mod ? to encode the word MATHY into a series of five numbers that are less than n.

b. To decrypt an RSA encrypted message, we need to find d, the multiplicative inverse of e 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.

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

Expert Solution

Colby Messinger answered 2 years ago

Part 1: Encrypt the message CINEMA using RSA with n = 17 * 11 and e...

Part 1: Encrypt the message CINEMA using RSA with n = 17 * 11 and e = 13, use A =10...Z = 35, work in blocks of one letter each. Part 2: Decrypt the message 088-164-051-164-021-074 using the same parameters from part 1.

Given two prime numbers 17 and 19. Compute the encryption and the decryption keys using RSA...

Given two prime numbers 17 and 19. Compute the encryption and the decryption keys using RSA algorithm.

Write C program for RSA encryption and decryptin, where: p = 11,q = 5, e =...

Write C program for RSA encryption and decryptin, where: p = 11,q = 5, e = 7

Please perform encryption and decryption given the following values of an RSA public key cryptosystem; p=17,...

Please perform encryption and decryption given the following values of an RSA public key cryptosystem; p=17, q=31, e=7 and M=2

IN PYTHON Generate valid keys (e, n) for the RSA cryptosystem.

In this question we show that we can use φ(n)/2. Let n = pq. Let x...

In this question we show that we can use φ(n)/2. Let n = pq. Let x be a number so that gcd(x, n) = 1. 1. show that xφ(n)/2 = 1 mod p and xφ(n)/2 = 1 mod q 2. Show that this implies that and xφ(n)/2 = 1 mod n 3. Show that if e · d = 1 mod φ(n)/2 then xe·d = 1 mod n. 4. How can we use φ(n)/2 in the RSA? Please explain answers...

7. Let n ∈ N with n > 1 and let P be the set of...

7. Let n ∈ N with n > 1 and let P be the set of polynomials with coefficients in R. (a) We define a relation, T, on P as follows: Let f, g ∈ P. Then we say f T g if f −g = c for some c ∈ R. Show that T is an equivalence relation on P. (b) Let R be the set of equivalence classes of P and let F : R → P be...

Question

8. (20 pts) a. RSA encryption. Let n = pq = (7)(17) = 119 and e...

Solutions

Expert Solution

Related Solutions