Consider the following 3-person encryption scheme based on RSA. L (can be trusted in this case)...

50.1K

Verified Solution

Question

Advance Math

Consider the following 3-person encryption scheme based on RSA.L (can be trusted in this case) generates two large primes p and q,calculates both n and Ï†(n). L also chooses k1, k2 and k3 such thatGCD(ki,n) = 1 and k1k2k3 â‰¡ 1 mod Ï†(n). Keys are securelydistributed to three others as follows:
G:
J: < n, k2, k3 >
Z: < n, k3, k1 >
Answer the following questions.
(a) G has a message M1 for J. Give the encryption function for Gas well as the decryption function for J, so that the message wonâ€™tbe seen by anyone else.ï¼ˆDetailed stepsï¼‰
(b) J has a message M2 for both G and Z. Give the encryptionfunction for J, as well as decryption functions for both G and Z,so that the message wonâ€™t be seen by any other person.ï¼ˆDetailedstepsï¼‰

Answer & Explanation Solved by verified expert

4.4 Ratings (783 Votes)

Given that k1mk2 and k3 are such that gcdkin1 and since a G has a message M1 for JEncryption theciphertext Decryption Checking the correctness Consider See Answer

Get Answers to Unlimited Questions

Join us to gain access to millions of questions and expert answers. Enjoy exclusive benefits tailored just for you!

Membership Benefits:

Unlimited Question Access with detailed Answers
Zin AI - 3 Million Words
10 Dall-E 3 Images
20 Plot Generations
Conversation with Dialogue Memory
No Ads, Ever!
Access to Our Best AI Platform: Flex AI - Your personal assistant for all your inquiries!

Become a Member