Re: RSA encryption/decryption

From: Unruh (unruh-spam_at_physics.ubc.ca)
Date: 09/18/05 

Date: 18 Sep 2005 20:01:40 GMT

"Milan VXdgsvt" <milan_vxdgsvt@seznam.cz> writes:

>Mxsmanic wrote:

>> 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.

>Was I've said is one bit means about 2 times the work, or less with a
>better algorithm, but still somewhat close to that.
>So factoring a 4096 bit number takes 2^(4096-512) times [the time to
>factor a 512 bit number].
>The point of my original post was we're faster than this, but certainly
>not so much.

Yes, by a HUGE amount. Factoring a 4096 bit number takes about 2^92 times
as much word as factoring a 512 bit number, not 2^3584 times as much time.
So yes, we are much much much faster than that (but certainly slower than
just 8 times as much time, yes.).

> Milan

Relevant Pages

  • Re: JSH: Ethics of a factoring solution
    ... When you post one of your solutions to the factoring problem there are ... Remember that I can find a solution to the RSA problem with a simple ... due warning and allowed time to change to a more secure method. ...
    (sci.crypt)
  • Re: JSH: Surrogate Factoring Fails Completely, What Next?
    ... RSA is only used BECAUSE ... >> bunch of propaganda that factoring is actually difficult. ... > factoring problem, and then went on to exploit that solution. ... > The world needs to deal with the math before it's forced upon it. ...
    (sci.crypt)
  • Re: backdoors in AES/RSA
    ... ]>> factoring is actually hard. ... cryptologists in your opinion. ... ]talk to a lay audience, they invariably explain results in lay ... that their rsa encrypted text would not be broken in the age of the ...
    (sci.crypt)
  • Re: Ive seen things you people wouldnt believe...
    ... Have you any idea why the RSA factoring challenge was terminated last ... I no longer work for RSA, ... no business could use it and claim ... Cash prizes were also proving quite problematic; ...
    (rec.arts.sf.fandom)
  • Re: JSH: A little direct talk
    ... the factoring congruences I found solve the factoring problem, ... Because, James, they are SLOW. ... any harm to RSA, unless it is FAST, and your method, so far, is NOT. ... are ACTIVELY trying to break RSA. ...
    (sci.crypt)