Elliptic curves, which are applied to public key cryptography, employ modular exponentiation that
characterizes the:

A.
Knapsack problem.

B.
Elliptic curve modular addition.

C.
Elliptic curve discrete logarithm problem.

D.
Prime factors of very large numbers.

Explanation:
The correct answer is “Elliptic curve discrete logarithm problem”. Modular exponentiation in elliptic
curves is the analog of the modular discreet logarithm problem. * Answer “Prime factors of very
large numbers” is incorrect because prime factors are involved with RSA public key systems; answer
c is incorrect because modular addition in elliptic curves is the analog of modular multiplication; and
answer “Knapsack problem” is incorrect because the knapsack problem is not an elliptic curve
problem.