Blum Blum Shub

Known as: Blum Blum Shub generator, Shub, Blum blum shub PRNG 
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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1971-2018
0102019712018

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… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
2016
2016
Cryptography is essential for secure online communications. Many different types of ciphers are implemented in modern-day… (More)
  • figure 1.1
  • figure 4.1
  • figure 4.2
  • figure 4.3
  • figure 4.4
Is this relevant?
2012
2012
Context. The cryptographically secure pseudo-random number generator Blum Blum Shub (BBS) is a simple algorithm with a strong… (More)
  • figure 2.1
  • table 2.1
  • figure 2.2
  • figure 3.1
  • table 3.1
Is this relevant?
2005
2005
The asymptotic security of the Blum-Blum-Shub (BBS) pseudorandom generator has been studied by Alexi et al. and Vazirani and… (More)
  • figure 1
Is this relevant?
Review
2003
Review
2003
Two types of BBS Pseudo-random sequence generators are presented and their relative strengths in terms of their predictability is… (More)
Is this relevant?
2000
2000
VLSI modules are proposed for fast, efficient generation of high-throughput Blum-Blum-Shub (BBS) and BBS-like sequences using… (More)
  • figure 1
Is this relevant?
2000
2000
  • Blum - Blum
  • 2000
VLSI modules are proposed for fast, efficient generation of high-throughput Blum-Blum-Shub (BBS) and BBS-like sequences using… (More)
  • figure 1
Is this relevant?
1998
1998
In this paper we compare recursively enumerable subsets of R” in two computing models over real numbers: the Blum-Shub-Smale… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
Is this relevant?
1994
1994
We propose a weak version of the Blum-Shub-Smale model of computation over the real numbers. In this weak model only a \moderate… (More)
Is this relevant?
1993
1993
W e propose a weak version of the Blum-Shub-Smale model of computation over the real numbers. In this weak model only a “moderate… (More)
Is this relevant?