Process For a LCG defined as Sn+1=aSn+bmodm Recovering m Define tn=Sn+1−Sn un=∣tn+2∗tn−tn+12∣ m=gcd(u1,…,uk), usually k≥10 Recovering a Recover a as ti=a⋅ti−1modm Recovering c Recover c as Si+1=a⋅Si+cmodm