Diffie-Hellman question

[Sarad AV]

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.

http://listserv.nodak.edu/scripts/wa.exe?A2=ind0202&L=nmbrthry&F=&S=&P=2568


Sarath.





	
		
__________________________________
Do you Yahoo!?
SBC Yahoo! - Internet access at a great low price.
http://promo.yahoo.com/sbc/