Kizspy | Question: 33 (Choose 1 answer)
FUOVERFLOW
Which of the following statements are true?
1. Given a large modulus n, the exponential operation mod n is computationally difficult.2.
Given a large modulus n, the discrete logarithm problem is computationally difficult.3. The discrete logarithm mod p always exists and is unique if p is a prime number.
4. Using the primitive roots of a prime modulus p yields the maximum p-1 possible outcome values for the discrete logarithm, which is desired for cryptography.
A. 1&2
B. 1 & 3
C. 1 & 4
D. 2 & 3
Ε. 2 & 4
F. 3 & 4
