Alice and bob use di?e-hellman


Alice and Bob use Di?e-Hellman to agree on a secret key. They choose prime p = 11, and a primitive root mod 11 g = 2. Alice chooses a random a = 5 and transmits g^a mod p = 2^5 mod 11 = 10 to Bob. Bob chooses random b = 7 and transmits g^b mod p = 2^7 mod 11 = 7 to Allice. What will the secret key they both agree upon be? Show all work.

Request for Solution File

Ask an Expert for Answer!!
Basic Computer Science: Alice and bob use di?e-hellman
Reference No:- TGS0109733

Expected delivery within 24 Hours