Question: 3. RSA with three primes would also work: n = pqr, (n) = (p1)(q1)(r1), gcd(e, (n)) = 1, and d = e 1 (mod (n)).

3. RSA with three primes would also work: n = pqr, (n) = (p1)(q1)(r1), gcd(e, (n)) = 1, and d = e 1 (mod (n)).

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

b) Encrypt m = 10000 and then decrypt the ciphertext.

c) Explain why RSA with three primes algorithm is not preferred

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!