Concepts2
∑MathAdvanced
Primitive Roots
A primitive root modulo n is a number g that cycles through all units modulo n when you repeatedly multiply by g, so its multiplicative order equals \(\varphi(n)\).
#primitive root#multiplicative order#euler totient+10
∑MathAdvanced
Discrete Logarithm
The discrete logarithm problem asks for x such that g^x ≡ h (mod p) in a multiplicative group modulo a prime p.
#discrete logarithm#baby-step giant-step#pollard rho dlp+12