cryptohard

LCG Embryonic

spbctf

Task: Full LCG parameter recovery when n, m, c are all unknown. Solution: Use GCD method on differences t[i+1]*t[i-1] - t[i]^2 to recover modulus n, then modular inverse for m and c.

$ ls tags/ techniques/
modular_arithmeticprnglcggcd
gcd_modulus_recoverylcg_full_recovery
🔒

Permission denied (requires tier.pro)

Sign in to access full writeups

Create a free account with GitHub, then upgrade to Pro.

$ssh [email protected]