On 12/24/05, Ivan Boldyrev <[EMAIL PROTECTED]> wrote: > sqrt(2^1024)=2^512
The factoring algorithm with the best running time is still the GNFS. See http://tinyurl.com/dlyl5 GNFS has a running time of: O(e^((64/9*log(n))^1/3 * (log(log(n)))^2/3) When you subsitute 2^(keylength) for n in that equation, I get the following table for RSA key strengths and the comparable symmetric key length: RSA Key Bits Operations Symmetric equivalent 192 1.92821E+12 40 256 1.11356E+14 46 384 8.09434E+16 56 512 1.75249E+19 63 640 1.78448E+21 70 768 1.0746E+23 76 1024 1.31176E+26 86 1536 1.30666E+31 103 2048 1.52656E+35 116 2560 4.71401E+38 128 3072 5.77594E+41 138 4096 1.28186E+47 156 13568 1.28393E+77 256 -- RPM ========================= All problems can be solved by diplomacy, but violence and treachery are equally effective, and more fun. -Anonymous _______________________________________________ Gnupg-users mailing list [email protected] http://lists.gnupg.org/mailman/listinfo/gnupg-users
