Log In
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 94 views

Please log in or register to answer this question.

Related questions

0 votes
1 answer
The Diffie-Hellman key exchange is being used to establish a secret key between Alice and Bob. Alice sends Bob (227, 5, 82). Bob responds with (125). Alice’s secret number, x, is 12, and Bob’s secret number, y, is 3. Show how Alice and Bob compute the secret key.
asked Mar 19, 2019 in Computer Networks ajaysoni1924 243 views
0 votes
1 answer
A math class has 25 students. Assuming that all of the students were born in the first half of the year—between January 1st and June 30th— what is the probability that at least two students have the same birthday? Assume that nobody was born on leap day, so there are 181 possible birthdays.
asked Mar 19, 2019 in Computer Networks ajaysoni1924 115 views
0 votes
0 answers
Alice wants to communicate with Bob, using public-key cryptography. She establishes a connection to someone she hopes is Bob. She asks him for his public key and he sends it to her in plaintext along with an X.509 certificate signed by the root CA. Alice already has the public key ... is talking to Bob? Assume that Bob does not care who he is talking to (e.g., Bob is some kind of public service).
asked Mar 19, 2019 in Computer Networks ajaysoni1924 70 views
0 votes
1 answer
Alice and Bob use RSA public key encryption in order to communicate between them. Trudy finds out that Alice and Bob shared one of the primes used to determine the number n of their public key pairs. In other words, Trudy found out that na = pa × q and nb = pb × q. How can Trudy use this information to break Alice’s code?
asked Mar 19, 2019 in Computer Networks ajaysoni1924 125 views