Which asymmetric cryptographic algorithm is specifically designed to allow two parties to establish a shared secret key over an insecure communication channel without prior authentication?
Answer and explanation
Correct answer: B. Diffie-Hellman key exchange
- Step 1: Diffie-Hellman allows two parties to create a mutual symmetric session key using modular exponentiation and discrete logarithms. Step 2. Eavesdroppers observing the exchanged public values cannot feasibly compute the private shared secret. Answer: Diffie-Hellman key exchange. Why not the others: AES is a symmetric cipher requiring a pre-shared key; RC4 is a legacy stream cipher; SHA-3 is an irreversible hash function.
Practise more Computer Systems, Networking and ICT.
Free questions with an explanation for every one, and full timed Bangladesh Civil Service Preliminary Examination mock tests.
More Computer Systems, Networking and ICT questions
- Which internal CPU register holds the memory address of the next machine instruction to be fetched and executed by the processor?
- Which type of computer memory provides the fastest read and write access times directly to the arithmetic logic unit?
- How many distinct memory addresses can be uniquely referenced by a microprocessor with a 32-bit address bus?
- What is the hexadecimal equivalent of the 8-bit binary number 11011010_2?
- Which logic gate outputs a binary 1 if and only if its two binary inputs are unequal (one is 1 and the other is 0)?
- Which two digital logic gates are considered universal gates because any combinational circuit can be constructed solely using either of the…