steven.soroka@mts.mb.ca
Wed, 9 Sep 1998 17:32:43 -0500
> BTW there was a paper at Crypto 98 by Patel and Sundaram about a
> discrete log based, provably secure RNG which is somewhat faster than
BBS.
> Can generate ~900 bits per exponentiation, compared to BBS which
generates
> 1 bit per squaring. Some people run BBS and use ~10 bits per squaring,
> but I'm not sure that is provably secure. If you do that, BBS is faster,
> otherwise the discrete log one is better.
Is the paper online? Anyone have the address if so?
The following archive was created by hippie-mail 7.98617-22 on Sat Apr 10 1999 - 01:13:58