Probabilistic Encryption

Timothy C. May tcmay at netcom.com
Thu Jul 14 10:58:02 PDT 1994



> solman at mit.edu says:
> > How secure do you guys think Probabilistic encryption using a BBS generator
> > is? It looks like its every bit as good for key exchanges as RSA and somewhat
> > better because of its speed.
> 
> The technique you mention is not one I've heard of. What is a BBS
> generator? Could you please explain?
> 
> Perry

Blum-Blum-Shub, a very strong random number generator, where guessing
the next bit is basically as hard as factoring some very large number.

It's main problem is that it's slow. 

Schneier has some actual code for implementing it in C.

--Tim May


-- 
..........................................................................
Timothy C. May         | Crypto Anarchy: encryption, digital money,  
tcmay at netcom.com       | anonymous networks, digital pseudonyms, zero
408-688-5409           | knowledge, reputations, information markets, 
W.A.S.T.E.: Aptos, CA  | black markets, collapse of governments.
Higher Power: 2^859433 | Public Key: PGP and MailSafe available.
"National borders are just speed bumps on the information superhighway."





More information about the cypherpunks-legacy mailing list