ITPEC FE Morning October 2020 Question 36
Which of the following is a type of public-key cryptography that utilizes the difficulty of factorizing extremely large numbers into primes?
Explanation
RSA — its security rests on how hard it is to factor the product of two very large primes.
RSA's public key includes a modulus n = p × q, where p and q are large secret primes. Multiplying them is easy, but recovering p and q from n is infeasible for keys of adequate length, and anyone who could factor n could compute the private key.
Answer (d)
Why not others:
- •(a) AES — a symmetric (common-key) block cipher, not public-key cryptography, and not based on factoring
- •(b) DH — Diffie-Hellman key exchange is public-key, but its security depends on the discrete logarithm problem
- •(c) DSA — the Digital Signature Algorithm is also based on the discrete logarithm problem, not factoring
Key rule: Tie each public-key algorithm to its hard problem: prime factorization is RSA; discrete logarithm is Diffie-Hellman and DSA; elliptic-curve discrete logarithm is ECC.
Security · AI-written, may contain errors
This question comes from an official ITPEC past paper. ITPEC Practice is an independent study tool and is not affiliated with ITPEC. See the official FE past-paper collection or Report an issue.