Diffie Hellman, Encryption, Symmetric Encryption, Cryptography, Security.
make understanding that part easier. Primitive root modulo n A number g is a primitive root modulo n if, for every integer a coprime with n, there is an integer k such that gᴷ ≡ a mod n. For example, 2 is a primitive root modulo 3. 2² = 4 ≡ 1 mod 3 2¹ = 2 ≡ 2 mod 3 Note: if n is prime, then there