Question: Suppose that Bob and Alice to use the Diffie-Hellman Algorithm to agree on a key. They will use the prime number 29 and g =
Suppose that Bob and Alice to use the Diffie-Hellman Algorithm to agree on a key.
They will use the prime number 29 and g = 3, which is a primitive root modulo 29. Alice will use the secret number a = 5 and Bob will use the secret number b = 6.
(a) What is the value of the number A that Alice will sent to Bob?
(b) What is the value of the number B that Bob will sent to Alice?
(c) After receiving the number A, Bob will compute the secret key s. Give Bobs computation of s
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
