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.
2018
2018
Design and FPGA Prototype of 1024- bit Blum-Blum-Shub PRBG Architecture
The necessity of hardware security for internet-of-things applications demands a low hardware area, high speed and secure… 
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… 
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… 
2010
2010
The Condition Metric in the Space of Rectangular Full Rank Matrices
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 with accumulations: Beyond the Blum, Shub and Smale model
Abstract geometrical computation (AGC) naturally arises as a continuous counterpart of cellular automata. It relies on signals… 
Highly Cited
2005
Highly Cited
2005
Concrete Security of the Blum-Blum-Shub Pseudorandom Generator
The asymptotic security of the Blum-Blum-Shub (BBS) pseudorandom generator has been studied by Alexi et al. and Vazirani and… 
1992
1992
On the Complexity of Some Problems for the Blum, Shub & Smale Model
We show some problems deriving from real algebra and semialgebraic geometry to be NP-complete or coNP-complete for the Blum, Shub… 
1992
1992
A problem that is easier to solve on the unit-cost algebraic RAM
1983
1983
SYMBOLIC DYNAMICS IN FLOWS ON THREE-MANIFOLDS
This article deals with the problem of what suspended subshifts of finite type can be realized as a basic set of a nonsingular… 
Highly Cited
1973
Highly Cited
1973
Nonfiction Film: A Critical History
"Nonfiction Film: A Critical History" covers almost one hundred years in the worldwide development of the non-fiction film, from… 
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)