cryptoeasy

LCG Warmup

spbctf

Task: Recover parameter c of LCG when multiplier m and modulus n are known. Solution: Use formula c = (x1 - m * x0) mod n with 2 consecutive outputs to find c and predict next value.

$ ls tags/ techniques/
modular_arithmeticprnglcg
modular_arithmeticlcg_parameter_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]