Knowledge check

Diffie-Hellman key exchange

10 questions testing what you just read — no login, no tracking, just immediate feedback.

Question 1 of 10

What does plain (unauthenticated) Diffie-Hellman fail to protect against?

Question 2 of 10

What property does ephemeral Diffie-Hellman (DHE/ECDHE) provide that static DH doesn't?

Question 3 of 10

What's the risk of choosing Diffie-Hellman parameters (p, g) carelessly?

Question 4 of 10

In what year was the Diffie-Hellman key exchange published, and by whom?

Question 5 of 10

In the module's worked example (p=23, g=5, a=6, b=15), what shared secret do Alice and Bob both independently compute?

Question 6 of 10

What replaces modular exponentiation when Diffie-Hellman is performed over elliptic curves (ECDH)?

Question 7 of 10

What is a "safe prime," in the context of choosing Diffie-Hellman parameters?

Question 8 of 10

Why do real protocols like TLS never use bare, unauthenticated Diffie-Hellman?

Question 9 of 10

What modern elliptic curve is the default key exchange in TLS 1.3, SSH, and most messaging protocols?

Question 10 of 10

What must a real DH implementation validate about a received public value, to avoid degenerate-input attacks?

0 / 10 answered