Groups
Category
Level
The discrete logarithm problem asks for x such that g^x ≡ h (mod p) in a multiplicative group modulo a prime p.
Modular arithmetic is arithmetic with wrap-around at a fixed modulus m, like numbers on a clock.
Fermat's Little Theorem says that for a prime p and integer a not divisible by p, a^{p-1} ≡ 1 (mod p).