An Example of Reading Math Formulas in a Slide

Cryptographically Secure Pseudorandom Number Generator Blum Blum Shub proposed by Lenore Blum, Manuel Blum and Michael Shub in 1986 x n+1 = xn2 mod M       where M is a product pq of two large primes p and q Interesting Feature xi = ( x02i mod λ(M) ) mod M where the Carmichael function λ(M) = λ(pq) = lcm(p−1,q−1)