Diffie-Hellman question

Sarad AV jtrjtrjtr2001 at yahoo.com
Tue May 18 02:48:25 PDT 2004

If your
> prime is 2000 bits,
> then that should be safe for the foreseeable future,
> unless quantum
> computers turn out to be practical for breaking
> moduli of this size.

Discrete Logarithms in GF(2^607)have been calculated
over polynomial basis.



Do you Yahoo!?
SBC Yahoo! - Internet access at a great low price.

More information about the cypherpunks-legacy mailing list