cryptography-prime-generator

Miller-Rabin Composite Validator

Midsquare Generator

LCG Linear Congruential Generator

X_n+1 = (aX_n + c) mod m

m, 0 < m - Modulus a, 0 < a < m - Multiplier c, 0 ≤ c < m - Increment X₀, 0 ≤ X₀ < m - Seed

Lehmer RNG period: m - 1

m, prime a, primitive modulo m c, 0

Tools: Mersenne primes & primitiveF

a 3 | 5 m 7

Hull–Dobell Theorem period: m

m & c, coprime c ≠ 0 a - 1, divisible by all prime factors of m a - 1, divisible by 4 if m divisible by 4

Tools: gcd 0

a 5 c = 17 m 2**3 <, <>>, ≤, ≥<<