Exam CISSP topic 1 question 338 discussion

C. Diffie-Hellman

Kerberos creates ticket granting tickets, it does not exchange keys. DSA and RSA are encryption algorhythms. Diffie-Hellman exchanges keys, but has to use another mechanism for the actual encryption. Second link below shows actual code to implement Diffie Hellman and use AES for the actual encryption. https://www.techtarget.com/searchsecurity/definition/Diffie-Hellman-key-exchange https://8thlight.com/insights/create-end-to-end-encryption-using-the-diffie-hellman-key-exchange

C. Diffie-Hellman The security of the Diffie-Hellman algorithm relies on the mathematical problem of calculating discrete logarithms in a finite field. In simple terms, it's computationally difficult to determine the secret key even if you know the public parameters exchanged during the protocol. The security of the Diffie-Hellman key exchange relies on the difficulty of calculating discrete logarithms, which is considered a hard mathematical problem. This makes it infeasible for an eavesdropper to deduce the shared secret key from the exchanged public keys. It's important to note that while Diffie-Hellman is excellent for securely exchanging keys, it doesn't provide encryption or decryption of messages itself.

B. Digital Signature Algorithm (DSA) "It functions on the framework of modular exponentiation and discrete logarithmic problems" It provides authentication, integrity, and non-repudiation. NOT encryption, which would be confidentiality https://www.simplilearn.com/tutorials/cryptography-tutorial/digital-signature-algorithm Diffie-Hellman does encrypt: "DH enables the two to use a public key to encrypt and decrypt their conversation or data using symmetric cryptography." https://www.hypr.com/security-encyclopedia/diffie-hellman-algorithim The question wanted the algorithm that does NOT encrypt, hence DSA.

C. Diffie-Hellman.

CISSP All-in-One Guide: The Diffie-Hellman algorithm enables two systems to generate a symmetric key securely without requiring a previous relationship or prior arrangements. The algorithm allows for key distribution, but does not provide encryption or digital signature functionality. The algorithm is based on the difficulty of calculating discrete logarithms in a finite field.

Not sure Y the model answer is A

It's Diffie-Hellman

he Diffie-Hellman algorithm is mostly used for key exchange. Although symmetric key algorithms are fast and secure, key exchange is always a problem. You have to figure out a way to get the private key to all systems

C. Diffie-Hellman

it should be DH

I am going with DH.

Def C here

What, This is definitely RSA

isnt it Diffie-Helman ? with discrete logarithms