The strength of RSApublic key encryption is based on the:
A.
Difficulty of multiplying two large prime numbers.
B.
Difficulty in finding logarithms in a finite field.
C.
Fact that only one key is used.
D.
Difficulty in finding the prime factors of very large numbers.
Explanation:
The correct answer is “Difficulty in finding the prime factors of very large numbers”. Answer
“Difficulty in finding the prime factors of very large numbers” applies to public key algorithms such
as Diffie-Hellman and Elliptic Curve. Answer “Difficulty of multiplying two large prime numbers” is
incorrect because it is easy to multiply two large prime numbers. Answer “Fact that only one key is
used” refers to symmetric key encryption.