Question

Consider a Diffie-Hellman scheme with a common prime q=11, and a primitive root α=2. a) If user „A‟ has public key YA=9, what is A‟s private key XA. b) If user „B‟ has public key YB=3, what is shared secret key K.

Answer 1

Answer:

Step 1 of 3 A The purpose of the Diffie-Hellman key exchange algorithm is to enable two users to exchange a secret key securely, that key is used for subsequent encryption of messages. • The two users create a public-key, private key pair and the public-key is communicated between each other. • The keys are designed to calculate the same unique secret key on both side based on each side's private-key and other sides public-key. • It is easy to calculate the exponential modulo of a prime number and it is infeasible for large prime numbers to calculate discrete algorithms. 0q...