Diffie-hellman algorithm to exchange a shared key


User A and B use Diffie-Hellman algorithm to exchange a shared key and generate public keys of their own. Consider a common prime number q=71 and α (a primitive root of q)=7. Determine the followings:
i. If user A has private key=5, what is A's public key?
ii. If user B has private key=12, what is B's public key?
iii. What is the shared key?
Show the full working process of your work in at least three steps in both
encryption and decryption. 

Request for Solution File

Ask an Expert for Answer!!
Data Structure & Algorithms: Diffie-hellman algorithm to exchange a shared key
Reference No:- TGS0109828

Expected delivery within 24 Hours