Multiple Choice
For any integer b and a primitive root a of prime number p we can find a unique exponent i .This exponent i is referred to as the ___________ .
A) order
B) discrete logarithm
C) bijection
D) primitive root
Correct Answer:

Verified
Correct Answer:
Verified
Related Questions
Q9: All integers have primitive roots.
Q17: With ordinary positive real numbers the logarithm
Q18: Discrete logarithms are not fundamental to public-key
Q19: The Miller-Rabin test can determine if a
Q20: The _ algorithm is typically used to
Q22: Discrete logarithms are analogous to ordinary logarithms
Q23: The procedure TEST takes a candidate integer
Q24: The number of positive integers less than
Q25: Discrete logarithms are fundamental to a number
Q26: Two numbers are relatively prime if they