Primitive Roots

Proofs of the existence of primitive roots modulo a prime, and the primitive-roots theorem are given. After the proof of Korselt’s theorem there is a description of how to find Carmichael numbers. The key-exchange protocols in cryptography is explained with an application of the discrete logarithm.