in Computer Networks
313 views
0 votes
0 votes
33. Two users can establish a shared secret key using the Diffie-Hellman algorithm, even
if they have never met, share no secrets, and have no certificates
(a) Explain how this algorithm is susceptible to a man-in-the-middle attack.
(b) How would this susceptibility change if n or g were secret?
in Computer Networks
313 views

Please log in or register to answer this question.

Related questions