Skip to search formSkip to main contentSkip to account menu

Blum Blum Shub

Known as: Blum-blum-shub PRNG, Blum Blum Shub generator, Shub 
Blum Blum Shub (B.B.S.) is a pseudorandom number generator proposed in 1986 by Lenore Blum, Manuel Blum and Michael Shub that is derived from Michael… 
Wikipedia (opens in a new tab)

Related topics

Related topics

16 relations
Blum–Micali algorithmComputational complexity theoryCrypto++Cryptographically secure pseudorandom number generator

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Secure scan-based design using Blum Blum Shub algorithm
Scan design is a powerful Design-for-Testability (DFT) technique that enhances controllability and observability of internal… 
2016
2016
Blum Blum Shub Generators and Steganography
2013
2013
Blum Blum Shub on the GPU
Context. The cryptographically secure pseudo-random number generator Blum Blum Shub (BBS) is a simple algorithm with a strong… 
2013
2013
The Blum-Blum-Shub Generator and Related Ciphers
This chapter covers stream ciphers with security proofs with a special focus on the Blum-Blum-Shub generator the most important… 
2013
2013
Satisfiability of cross product terms is complete for real nondeterministic polytime Blum-Shub-Smale machines
Nondeterministic polynomial-time Blum-Shub-Smale Machines over the reals give rise to a discrete complexity class between NP and… 
2000
2000
Fast Blum-Blum-Shub Sequence Generation Using Montgomery Multiplication
VLSI modules are proposed for fast, efficient generation of high-throughput Blum-Blum-Shub (BBS) and BBS-like sequences using… 
1997
1997
Prevalence of Non-lipschitz Anosov Foliations
We give sharp regularity results for the invariant subbundles of hyperbolic dynamical systems and give open dense sets of… 
1997
1997
A Distributed Search and Simulation Method for Job Flow Scheduling
Simulation serves as an effective decision support tool in flexible manufacturing systems for understanding and analyzing the… 
1995
1995
Stabilization methods for simulations of constrained multibody dynamics
The descriptor form of constrained multibody systems, and any general formulation of such systems with closed loops, yield index… 
1971
1971
A Note on "Axioms" for Computational Complexity and Computation of Finite Functions
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)