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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Scan design is a powerful Design-for-Testability (DFT) technique that enhances controllability and observability of internal… 
2013
2013
Context. The cryptographically secure pseudo-random number generator Blum Blum Shub (BBS) is a simple algorithm with a strong… 
2013
2013
This chapter covers stream ciphers with security proofs with a special focus on the Blum-Blum-Shub generator the most important… 
2010
2010
The condition metric in spaces of polynomial systems has been introduced and studied in a series of papers by Beltran, Dedieu… 
2007
2007
Abstract geometrical computation (AGC) naturally arises as a continuous counterpart of cellular automata. It relies on signals… 
2000
2000
VLSI modules are proposed for fast, efficient generation of high-throughput Blum-Blum-Shub (BBS) and BBS-like sequences using… 
1997
1997
We give sharp regularity results for the invariant subbundles of hyperbolic dynamical systems and give open dense sets of… 
1992
1992
We show some problems deriving from real algebra and semialgebraic geometry to be NP-complete or coNP-complete for the Blum, Shub… 
1983
1983
This article deals with the problem of what suspended subshifts of finite type can be realized as a basic set of a nonsingular…