Which algorithm gets its security from the difficulty of calculating discrete logarithms in a finite field and is used to distribute keys, but cannot be used to encrypt or decrypt messages?

The correct answer is A. Diffie-Hellman. Diffie-Hellman is an algorithm that gets its security from the difficulty of calculating discrete logarithms in a finite field and is used to distribute keys, but cannot be used to encrypt or decrypt messages. Diffie-Hellman is a key exchange protocol that allows two parties to e

Submitted by jakub_pl· Mar 5, 2026Security Architecture and Engineering

Question

Options

ADiffie-Hellman
BDigital Signature Algorithm (DSA)
CRivest-Shamir-Adleman (RSA)
DKerberos

How the community answered

(30 responses)

A
93% (28)
B
3% (1)
D
3% (1)

Explanation

Diffie-Hellman is an algorithm that gets its security from the difficulty of calculating discrete logarithms in a finite field and is used to distribute keys, but cannot be used to encrypt or decrypt messages. Diffie-Hellman is a key exchange protocol that allows two parties to establish a shared secret key over an insecure channel, without any prior knowledge or communication. The shared secret key can then be used for symmetric encryption or authentication. Diffie-Hellman does not perform any encryption or decryption by itself, and it does not provide any authentication or integrity guarantees.

Topics

#Diffie-Hellman#key exchange#cryptography#discrete logarithm

Community Discussion

No community discussion yet for this question.

Full CISSP Practice