Rsa with three primes would also work n pqr n p1q1r1 gcde


Question -RSA with three primes would also work: n = pqr, ?(n) = (p?1)(q?1)(r?1), gcd(e, ?(n)) = 1,

and d = e^?1 (mod ?(n)).

Part 1- Setup an example RSA public/private key pair using primes 29, 31, 37, and e = 17.

Part 2- Encrypt m = 10000 and then decrypt the cipher text.

Part 3- Explain why it is not preferred.

I am not sure how to solve the question. Can anyone help me?

Request for Solution File

Ask an Expert for Answer!!
Computer Network Security: Rsa with three primes would also work n pqr n p1q1r1 gcde
Reference No:- TGS0967173

Expected delivery within 24 Hours