Concepts3
∑MathAdvanced
Pollard's Rho Factorization
Pollard's Rho is a randomized algorithm that finds a non-trivial factor of a composite integer by walking a pseudorandom sequence modulo n and extracting a factor with a gcd.
#pollard's rho#integer factorization#cycle detection+10
∑MathIntermediate
Miller-Rabin Primality Test
Miller–Rabin is a fast primality test that uses modular exponentiation to detect compositeness with very high reliability.
#miller-rabin#primality test#probable prime+11
∑MathIntermediate
Fermat's Little Theorem
Fermat's Little Theorem says that for a prime p and integer a not divisible by p, a^{p-1} ≡ 1 (mod p).
#fermat's little theorem#modular inverse#binary exponentiation+11