Question 4: This question is on the Diffie-Hellman key exchange. Alice sends x₁ = = aa mod p and Bob sends x2 a¹ mod p.
Posted: Thu May 05, 2022 1:33 pm
No code, please explain.
Question 4: This question is on the Diffie-Hellman key exchange. Alice sends x₁ = = aa mod p and Bob sends x2 a¹ mod p. Say that gcd(b, p − 1) = 1. Show that knowing p, x2,and b allows to find a.
Question 4: This question is on the Diffie-Hellman key exchange. Alice sends x₁ = = aa mod p and Bob sends x2 a¹ mod p. Say that gcd(b, p − 1) = 1. Show that knowing p, x2,and b allows to find a.