Other Directory Sites: SeekWonder | Directory Owners Forum
The following archive was created by hippie-mail 7.98617-22 on Sat Apr 10 1999 - 01:13:58
lcs Mixmaster Remailer (mix@anon.lcs.mit.edu)
4 Sep 1998 18:20:07 -0000
Do you know what a quadratic residue is? It is a number which is a square
of some other number (mod n). So you can either find one by choosing
a random number and seeing if it is a QR (by calculating the Jacobi
symbols) or you can just choose a random number and square it mod n.
Squaring automatically makes it a quadratic residue, by definition. You
don't need the Jacobi tests if you do it this way, it's much faster.
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.
The following archive was created by hippie-mail 7.98617-22 on Sat Apr 10 1999 - 01:13:58