Re: RSA encryption/decryption

From: Mxsmanic (mxsmanic_at_gmail.com)
Date: 09/18/05 

Date: Sun, 18 Sep 2005 20:03:28 +0200

Milan VXdgsvt writes:

> For Mxsmanic: current factoring algorithms are more effective than
> O(log(N)). Increasing the length of the number to be factored by one
> bit does not take 2x times longer anymore.

The factoring time doesn't vary directly with the length of the number
to be factored, either. If it did, RSA would have been dead and
buried long ago, since factoring 4096-bit numbers would require only
eight times as much time as factoring 512-bit numbers. 

--
Transpose mxsmanic and gmail to reach me by e-mail.