Which public-key cryptographic algorithm is based on the mathematical difficulty of factoring the product of two large prime numbers?
Answer and explanation
Correct answer: A. RSA algorithm
- Step 1: Invented by Rivest, Shamir, and Adleman in 1977, RSA relies on prime factorization intractability. Step 2. It is universally implemented in digital signatures, software licensing, and TLS security certificates. Answer: RSA algorithm. Why not the others: AES and DES are symmetric block ciphers; Diffie-Hellman is a key exchange protocol based on discrete logarithms.
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…