Discrete Logarithm and Primitive Root Quiz Answer

Asymmetric Cryptography and Key Management Quiz Answer Coursera

Go to this Course 

In this article i am gone to share Coursera Course: Asymmetric Cryptography and Key Management Week 3 Quiz | Discrete Logarithm and Primitive Root Quiz Answer with you..

Week 3 Quiz Answer

Quiz 1: Discrete Logarithm and Primitive Root

Question 1)

What is the value of the discrete logarithm of 3 base 2 mod 5?

• 3

Question 2)

What is the value of the discrete logarithm of 4 base 5 mod 7?

• 2

Question 3)

Identify the primitive roots of the prime number 3. Select all that applies.

• 0
• 1
• 2

Question 4)

Identify the primitive roots of the prime number 7. Select all that applies.

• 1
• 6
• 2
• 3
• 5
• 4

Question 5)

Which of the following statements are true?

• The discrete logarithm mod p always exist and is unique if p is a prime number.
• Given a large modulus n, the discrete logarithm problem is computationally difficult.
• Given a large modulus n, the exponential operation mod n is computationally difficult.
• 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.