5. We consider the Diffie-Hellman key exchange scheme with certificates. We have

Question

5. We consider the Diffie-Hellman key exchange scheme with certificates. We have a system with the three users Alice, Bob and Charley. The Diffie-Hellman algorithm uses p = 61 and = 18. The three secret keys are a 11, b 22 and c 33. The three IDs are ID(A)=1, ID(B)=2 and ID(C-3. For your convenience, Diffie-Hellman Key Exchange with Certificates is as shown below: Diffie-Hellman Key Exchange with Certificate:s Alice Bob a = kprA Ba mod p Cert (AIDA),SA Certa Certs verify certificate raCert) KABA mod p verify certificate Verapca Certg) compute session key compute session key For signature generation, the Elgamal signature scheme is used. For your convenience, Elgamal scheme is as shown below: Key Gene ration for Elgamal Digital Signature 1. Choose a large prime p 2. Choose a primitive element of Z:, or a subgroup ofT 3. Choose a random integer d E (2,3,...,p -2] 4. Compute = mod p .

Explanation / Answer

1.

Related Questions

Navigate

• Browse (All)
• Browse 5
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.