BLUM BLUM SHUB GENERATOR ALGORITHM EXAMPLE MOD
Based on the squaring one-way function Let p, q be two odd primes and pq3 mod 4 Let n pq Let x0 be a seed which is a quadratic residue modulo n. If anyone could translate it to PB it'd be very much appreciated (and youll be eternally credited as the person to bring BBS to PB ) - Blum-Blum-Shug, although too new to say for sure, is generally considered the most secure PRNGs in existance at the moment and is regarded as cryptographically secure, having similar properties to RSA, yet the algorithm is surprisingly small for what it does. Example (Z17, ) is a cyclic group with order 16, 3 is the generator of the group and 316 1 mod 17 Let k4. Blum Blum Shub Blum Blum Shub (B.B.S.) It is a pseudorandom number generator proposed in 1986by Lenore Blum, Manuel Blum and Michael Shub (Blum et al., 1986).Blum Blum Shub takes the form: Xn+1 Xn2mod n Where np x q is the product of two large primes p and q. 4 Working with composite moduli and the Blum-Blum-Shub generator.
BLUM BLUM SHUB GENERATOR ALGORITHM EXAMPLE CODE
Any C gurus around with a taste for crypto? Ive finally found some source code to the Blum-Blum-Shub PRNG, it's just 2,187 bytes in C code but still out of the grasp of my pathetic C-to-PB translating abilities This video is a part of cryptography series which explains the BBS(Blum Blum Shub Generator) in detail.I have also explained the Blum Blum Shub Algorithm wit.