This document describes a Diffie-Hellman key exchange scheme with a prime of 11 and primitive root of 2. It asks (a) if user A's public key is 4, what is their private key, and (b) if user B's public key is 7, what is the shared secret key.
This PowerPoint helps students to consider the concept of infinity.
There are 2 parts with this question that utilize the Diffie.pdf
1. There are 2 parts with this question that utilize the Diffie-Hellman scheme with the following prime
and root for both these parts of the question. Assistance is greatly appreciated.
Consider a Diffie-Hellman scheme with a common prime q = 11 and a primitive root a = 2.
a. If user A has public key Y
A
= 4, what is A's private key X
A
?
b. If user B has public key Y
B
=7, what is the shared secret key K?