Primitive Root

Checks whether alpha is a primitive root of q or not.

If alpha is a primitive root of q,then alpha^1,alpha^2,aplha^3,......alpha^(q-1)mod q must generate distinct integers from 1 to q-1.

This concept is useful for study of discrete logarithms.

This is used in the Diffie-Hellman Key exchange, where q and alpha are global variables selected by a user which is public.