Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 224,684,880 papers from all fields of science
Search
Sign In
Create Free Account
Blum Blum Shub
Known as:
Blum-blum-shub PRNG
, Blum Blum Shub generator
, Shub
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
16 relations
Blum–Micali algorithm
Computational complexity theory
Crypto++
Cryptographically secure pseudorandom number generator
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Secure scan-based design using Blum Blum Shub algorithm
Elnaz Koopahi
,
S. E. Borujeni
East-West Design & Test Symposium
2016
Corpus ID: 19455335
Scan design is a powerful Design-for-Testability (DFT) technique that enhances controllability and observability of internal…
Expand
2013
2013
Blum Blum Shub on the GPU
Mikael Olsson
,
N. Gullberg
2013
Corpus ID: 60776115
Context. The cryptographically secure pseudo-random number generator Blum Blum Shub (BBS) is a simple algorithm with a strong…
Expand
2013
2013
The Blum-Blum-Shub Generator and Related Ciphers
Andreas Klein
2013
Corpus ID: 117853790
This chapter covers stream ciphers with security proofs with a special focus on the Blum-Blum-Shub generator the most important…
Expand
2012
2012
Certifying assembly with formal security proofs: The case of BBS
Reynald Affeldt
,
David Nowak
,
Kiyoshi Yamada
Science of Computer Programming
2012
Corpus ID: 10163083
2010
2010
The Condition Metric in the Space of Rectangular Full Rank Matrices
P. Boito
,
J. Dedieu
SIAM Journal on Matrix Analysis and Applications
2010
Corpus ID: 8813019
The condition metric in spaces of polynomial systems has been introduced and studied in a series of papers by Beltran, Dedieu…
Expand
2007
2007
Abstract geometrical computation with accumulations: Beyond the Blum, Shub and Smale model
J. Durand-Lose
2007
Corpus ID: 41541677
Abstract geometrical computation (AGC) naturally arises as a continuous counterpart of cellular automata. It relies on signals…
Expand
2000
2000
Fast Blum-Blum-Shub Sequence Generation Using Montgomery Multiplication
Blum-Blum
2000
Corpus ID: 15581196
VLSI modules are proposed for fast, efficient generation of high-throughput Blum-Blum-Shub (BBS) and BBS-like sequences using…
Expand
1997
1997
Prevalence of Non-lipschitz Anosov Foliations
K. Kuperberg
1997
Corpus ID: 17918504
We give sharp regularity results for the invariant subbundles of hyperbolic dynamical systems and give open dense sets of…
Expand
1992
1992
On the Complexity of Some Problems for the Blum, Shub & Smale Model
F. Cucker
,
F. Rosselló
Latin American Symposium on Theoretical…
1992
Corpus ID: 24174511
We show some problems deriving from real algebra and semialgebraic geometry to be NP-complete or coNP-complete for the Blum, Shub…
Expand
1983
1983
SYMBOLIC DYNAMICS IN FLOWS ON THREE-MANIFOLDS
J. Franks
1983
Corpus ID: 122771229
This article deals with the problem of what suspended subshifts of finite type can be realized as a basic set of a nonsingular…
Expand
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)
ACCEPT & CONTINUE