Primitive root modulo p

From CryptoWiki
Jump to: navigation, search

Primitive root modulo m — an integer g, such that g φ(p)(mod m) = 1, where φ(p) is the Euler function.

To main page of the section