The secret key exchange has been the most critical pain point of symmetric ciphers. Diffie-Hellman (DH) is a key agreement protocol to solve the problem. Which one of the following is correct about DH? (Wentz QOTD)
A. Diffie-Hellman by itself can enforce authenticity.
B. Diffie-Hellman can use elliptic curve operations to generate secret keys.
C. Diffie-Hellman is designed to transmit secret keys over an insecure channel.
D. Diffie-Hellman can use modular arithmetic to generate secret keys.
Kindly be reminded that the suggested answer is for your reference only. It doesn’t matter whether you have the right or wrong answer. What really matters is your reasoning process and justifications.
My suggested answer is D. Diffie-Hellman can use modular arithmetic to generate secret keys.
Wentz’s book, The Effective CISSP: Security and Risk Management, helps CISSP and CISM aspirants build a solid conceptual security model. It is a tutorial for information security and a supplement to the official study guides for the CISSP and CISM exams and an informative reference for security professionals.
Diffie-Hellman can use modular arithmetic to generate secret keys.
- Diffie-Hellman by itself doesn’t deal with authentication, so it doesn’t enforce authenticity.
- Diffie-Hellman is a key agreement protocol, which negotiates a secret key between two parties. It does need to generate a public-private key pair used to produce the secret key.
- Diffie-Hellman negotiates a new secret key but secret keys are not substantially transmitted over an insecure channel.
Reference
- Diffie–Hellman key exchange
- Elliptic-curve Diffie–Hellman
- Elliptic curve point multiplication
- Discrete logarithm
- 0x01a: Diffie-Hellman Protocol
密鑰的交換一直是對稱密碼(cipher)最關鍵的痛點。 Diffie-Hellman (DH) 是解決該問題的金鑰協議(agreement)協定。 下列哪一項關於 DH 是正確的？ (Wentz QOTD)
A. Diffie-Hellman 本身可以強制執行真實性。
B. Diffie-Hellman 可以使用橢圓曲線運算來生成密鑰。
C. Diffie-Hellman 被設計用來在不安全的通道傳輸密鑰。
D. Diffie-Hellman 可以使用模運算來生成密鑰。