Exam weight Low
Exam weight High
- Diffie–Hellman lets two parties agree on a shared secret over an insecure channel. It exchanges a KEY; it doesn’t encrypt messages.
🎯 How this can come up · 1 question
MCQ
Diffie–Hellman is used for:
Correct: Key exchange.
Exam weight Low
Exam weight Low
- A primitive root g of prime q: its powers g¹ … g^(q−1) mod q produce every number 1 … q−1.
Exam weight Low
Exam weight High
- Alice: private a, sends A = gᵃ mod q. Bob: private b, sends B = gᵇ mod q. Shared K = Bᵃ = Aᵇ = gᵃᵇ mod q.
🎯 How this can come up · 1 question
Written
q = 23, g = 5, a = 6, b = 15. Find A, B and the shared key.
A = 5⁶ mod 23 = 8. B = 5¹⁵ mod 23 = 19. K = 19⁶ mod 23 = 8¹⁵ mod 23 = 2.
Exam weight Low
Exam weight Low
- Security rests on the discrete logarithm problem: from gᵃ mod q it is infeasible to find a.
Exam weight Low
Exam weight Low
Exam weight High
- MITM: Darth swaps in his own values and shares one key with Alice and another with Bob. Plain DH has no authentication; fix with signatures or certificates.
Exam trapDiffie–Hellman alone is vulnerable to man-in-the-middle because the public values are not authenticated.
🎯 How this can come up · 1 question
MCQ
Unauthenticated Diffie–Hellman is vulnerable to:
Correct: Man-in-the-middle attacks.
Exam weight Low
No slides match this filter.







