Unlike all RNGs mentioned above, this generator has very strong
cryptographic properties such as PT unpredictable (see Section
2.2) based on the unproven assumption
that PNP in computational complexity theory.
Proposed in , BBS is a random bit generator with the following
However, BBS is not a permutation generator as the RNGs mentioned above. A -permutation generator is a program which produces permutations of a set of distinct objects. Each of these permutations is called a -permutation. A full-period RNG with period length is also an -permutation generator since any consecutive outputs form an -permutation. The period length of BBS is much lesses than , therefore, it can not be adapted to produce uniform random variates between 1 and . For example, use use , and hence the period is much lesser than 16873. Due to this reason, BBS failed all of the statistical tests we have conducted and is therefore not suitable for stochastic simulations. BBS also has a performance flaw since in practical use must be sufficiently large (like tens or even hundreds of digits) to provide resistance from being factorized in a short time.