Let p and q be two large prime numbers that are congruent to 3 (mod 4) and let M = pq. Let the seed x0 be an integer greater than 1 that is coprime to M. Then let
xn+1 = xn2 mod M
You have just generated pseudorandom numbers by means of what triply-eponymous algorithm?
Blum Blum Shub