Loading ...
Sorry, an error occurred while loading the content.
 

Re: {Spam?} Re: {Spam?} RE: [PrimeNumbers] RSA Challenge Numbers and my inovative method of factoring

Expand Messages
  • Paul Leyland
    ... Milmore mailed me the text which he had failed to post earlier. It contains a decription of Fermat s factorization method and a few examples for small
    Message 1 of 4 , Mar 23, 2010
      On Mon, 2010-03-22 at 14:10 +0000, Paul Leyland wrote:
      >
      > On Mon, 2010-03-22 at 07:51 -0500, Chris Caldwell wrote:
      > >
      > > > Analysis of the last four solutions of the RSA numbers: 200, 576,
      > > 640
      > > and 768. Additional material validating my approach and an
      > > > open challenge to the group to critique and comment. Next an
      > attack
      > > on
      > > RSA-704. Methodly previosly posted, I think.

      > I seem to be missing something. Context, to be precise. Could someone
      > point me to the 'methodly previosly posted'[sic]?

      Milmore mailed me the text which he had failed to post earlier. It
      contains a decription of Fermat's factorization method and a few
      examples for small numbers.

      Fermat's method is a few centuries old and is less efficient, in
      general, than trial division.

      Summary: nothing to see here folks, move along.


      Paul
    Your message has been successfully submitted and would be delivered to recipients shortly.