Questions tagged [blum-blum-shub]

The Blum Blum Shub generator is a deterministic Pseudo-Random Bit Generator with security demonstrably reducible to that of integer factorization.

Filter by
Sorted by
Tagged with
3 votes
1 answer
298 views

Period of Blum-Blum-Shub

Reading about Blum-Blum-Shub, I have found that everyone has stressed the importance of $gcd(p-1, q-1)$ being a small number, as this leads to a large period. I found it really difficult to find a ...
Giorgos Mitropoulos's user avatar
0 votes
0 answers
35 views

Chosen plaintext attack on Blum–Goldwasser cryptosystem

As I was reading on some encryption schemes the other day, I stumbled upon the Blum–Goldwasser cryptosystem and read that it is vulnerable to adaptive chosen ciphertext attack. I searched for some ...
bd55's user avatar
  • 33
2 votes
1 answer
139 views

Significance of having remainder $3$ when divided by $4$ for both $p$ and $q$ in BBS

In the Blum Blum Shub random number generator, we take two random prime numbers $p$ and $q$ such that both have a remainder of $3$ when divided by $4$. My question is why can't we just take any $2$ ...
swarna islam's user avatar
3 votes
2 answers
329 views

How big does M need to be in Blum Blum Shub?

I've read that Blum Blum Shub is a CSPRNG, defined by $x_{n+1} = x_n^2 \bmod M$. I didn't understand that, and couldn't find any sources on how big $M$ should be. Are 32 bits enough? 64 bits? Or are ...
Command Master's user avatar
0 votes
0 answers
77 views

using non prime numbers in Blum Blum Shub or Blum Micali

I would like to use Blum Blum Shub, or Blum Micali methods as random number generators only. I am not interested in their encryption capabilities. I was wondering, if I replaced the prime numbers ...
Tararu's user avatar
  • 15
6 votes
2 answers
1k views

Blum Blum Shub Pseudo-Random Generator Requirements

I am trying to understand the Blum Blum Shub pseudo-random generator originally described in A Simple Unpredictable Pseudo-random Number Generator As best I can tell the requirements are: For any $...
ben rudgers's user avatar
1 vote
1 answer
157 views

Understanding $\varepsilon$-advantage in cryptographically secure deterministic RNG

In Efficient and Secure Pseudo-Random Number Generation by Vazirani & Vazirani, it is stated that every pseudorandom number generator which satisfies the XOR Condition can securely output $\log n$ ...
Antonio Frighetto's user avatar
1 vote
1 answer
145 views

Stream cipher -- Are all random bit generators suitable for stream cipher?

I learned the stream cipher using LFSR in the book. I wonder whether all random bit generators (i.e. BBS, Rabin generator) are suitable for stream cipher. I search using keywords "stream cipher" and "...
Evian's user avatar
  • 163
8 votes
1 answer
631 views

How did SHA-1 'feed' Blum Blum Shub

One of the most (in)famous hardware derived random number generators was Lavarand (patent). It did it with funky lava lamps. An image of the lamps was hashed and fed into Blum Blum Shub (BBS) to ...
Paul Uszak's user avatar
  • 15.3k
4 votes
1 answer
338 views

Blum Blum Shub Hash

Will this algorithm make a cryptographically secure hash function? Can it be used to generate passwords? Is it secure enough for use as a MAC? Divide the message into blocks. The initial state is $h=...
user43678's user avatar
7 votes
2 answers
431 views

Are factorization algorithms parallelizable?

I was reading about the Blum-Blum-Shub random number generator, and its security depends on the hardness of factoring very large numbers (like many things in crypto do). I'm just wondering, if I have ...
Maestro's user avatar
  • 1,069
1 vote
2 answers
306 views

If Blum Blum Shub is modified to use a prime modulus, is it still secure?

The definition of the Blum Blum Shub cryptographically secure pseudorandom number generator is $x=x^2 \mod N$ where $N=p \times q$, $p \in \mathbb P$, and $q \in \mathbb P$. Supposedly, the security ...
Melab's user avatar
  • 3,645
1 vote
1 answer
557 views

Why is knowing M not enough to break Blum Blum Shub?

In Blum Blum Shub, the generator is $x_{n+1}={x_n}^2 \mod M$ where $M=p \cdot q$, $p \in \mathbb P$, and $q \in \mathbb P$. Supposedly, knowing $p$ and $q$ is enough to break the system. But if I know ...
Melab's user avatar
  • 3,645
1 vote
0 answers
224 views

Exploration of Blum Micali Security By Seed Size

I'm new to cryptography and am most intrigued by mathematically based pseudo random number generators. With reference to the Blum Micali algorithm: $X_{i+1} = G^{X_i} \bmod P$ can security be ...
0rob's user avatar
  • 31
0 votes
2 answers
584 views

Is BBS used for generation of keys for any modern cryptosystem?

Is there any (current) cryptosystem or digital signature or cryptographic primitive that uses the BBS PRG in order to generate its secret keys?
111's user avatar
  • 796
3 votes
2 answers
918 views

Advantages to knowing $p$ and $q$ in Blum Blum Shub?

Do you gain any advantage by knowing the factorization of $M$ (over just knowing $M$ itself) in the Blum Blum Shub generator? The only advantage I see is being able to calculate the $i$-th number ...
Jaws212's user avatar
  • 133
3 votes
1 answer
220 views

Why is $-1$ an illegal message in the Goldwasser-Micali Encryption Scheme

I'm not sure why in the Goldwasser-Micali encryption scheme with a Blum integer $N$, the message $-1$ is always a illegal message. Can you give me some direction for starting? What is illegal ...
user9189's user avatar
31 votes
2 answers
6k views

Blum Blum Shub vs. AES-CTR or other CSPRNGs

Following on from D.W.'s comments on a previous question, what properties does Blum Blum Shub have that make it better / worse than other PRNGs? Are there significant implementation difficulties or ...
Polynomial's user avatar
  • 3,527
6 votes
2 answers
2k views

How many bits can be safely extracted from the BBS generator at each step?

The Blum-Blum-Shub generator is a deterministic Pseudo-Random Bit Generator with security reducible to that of integer factorization. Setup: Secretly chose random primes $P$, $Q$, with $P\equiv Q\...
fgrieu's user avatar
  • 140k
3 votes
2 answers
790 views

Is the Blum Blum Shub PRNG suitable to create initialization vectors?

Is it a good idea to use a Blum Blum Shub Generator to create my initialization Vector (IV) in AES-OFB (Output Feedback Mode)?
goldroger's user avatar
  • 1,727