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.
Review
2016
Review
2016
The security of several homomorphic encryption schemes depends on the hardness of variants of the approximate common divisor (ACD… 
2013
2013
This chapter covers stream ciphers with security proofs with a special focus on the Blum-Blum-Shub generator the most important… 
Highly Cited
2012
Highly Cited
2012
Many wild browse and bush species are undervalued mainly because of insufficient knowledge about their potential feeding value… 
2009
2009
In this work we obtain a new criterion to establish ergodicity and nonuniform hyperbolicity of smooth measures of diffeomorphisms… 
Highly Cited
2005
Highly Cited
2005
The asymptotic security of the Blum-Blum-Shub (BBS) pseudorandom generator has been studied by Alexi et al. and Vazirani and… 
Highly Cited
1996
Highly Cited
1996
We estimate the probability that a given number of projective Newton steps applied to a linear homotopy of a system of n… 
Highly Cited
1994
Highly Cited
1994
. We investigate the energy of arrangements of N points on the surface of a sphere in R 3 , interacting through a power law… 
Highly Cited
1993
Highly Cited
1993
  • P. Koiran
  • 1993
  • Corpus ID: 5159103
We propose a weak version of the Blum-Shub-Smale model (1989) of computation over the real numbers. In this weak model only a… 
Highly Cited
1989
Highly Cited
1989
. We present a model for computation over the reals or an arbitrary (ordered) ring R. In this general setting, we obtain…