excessive usage of /dev/random?
Robert J. Hansen
rjh at sixdemonbag.org
Tue May 5 15:51:00 CEST 2015
> we don't have any provably cryptographically strong generators (well,
> you can argue about BBS I guess...)
I thought BBS had a proof of security related to the difficulty of the
quadratic residuosity problem. Given how close that is to IFP, BBS
seems to be as secure as RSA, which is good enough for my purposes. ;)
Or is there some new development related to BBS that I'm unaware of?
-------------- next part --------------
A non-text attachment was scrubbed...
Size: 3744 bytes
Desc: S/MIME Cryptographic Signature
More information about the Gnupg-devel