Linked Questions
10 questions linked to/from Blum Blum Shub vs. AES-CTR or other CSPRNGs
84
votes
11answers
9k views
Is modern encryption needlessly complicated?
RSA, DES, AES, etc., all use (relatively) complicated mathematics to encrypt some message with some key. For each of these methods, there have been several documented vulnerabilities found over the ...
5
votes
2answers
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\...
6
votes
2answers
235 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 ...
6
votes
1answer
392 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 ...
0
votes
2answers
395 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?
4
votes
1answer
219 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=...
1
vote
1answer
338 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 ...
-1
votes
1answer
169 views
Which is the longest CSPRNG?
There are some PRNGs considered cryptographically secure.
Which has the longest period among them?
1
vote
0answers
123 views
Rating a steganographic system using Blum Blum Shub to locate hidden bits
Currently I'm building a toy steganography system based in a web browser. Besides all the obvious issues with building a system requiring extreme privacy into a browser (this is a toy!), I was curious ...
1
vote
0answers
108 views
Pseudorandom number generators based on hard problems in mathematics
I know that Dual_EC_DRBG's security is based on the ellitpic curve discrete logarithm problem, Micali-Schnorr is based on the difficulty of factorization, and MQ_DRBG is based on multivariate ...