6. (a) Give an upper bound on how many operations i g i mod n one...

Question:

6.

(a) Give an upper bound on how many operations i → gi mod n one must perform in order to verify (or refute) that an invertible element g is a primitive root for Zn*

(b) Assume that you have a complete prime factorization of φ(n). Using Lagrange's theorem, how many operations gi mod n do you now require, and for which values of i?

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Question Posted: