Re: Surrogate factoring, update

From: Matthijs Hebly (heeb_at_iname.com)
Date: 07/10/04 

Date: Sat, 10 Jul 2004 16:37:33 GMT

James Harris wrote:
> It's been a while since I mentioned surrogate factoring, and I'll
<znib>
Maybe you should put your method to the test? Let your PC make a huge
composite of two primes (something in the magnitude used for RSA), and
challenge yourself to factor it, without looking at the answer. If your
method is too slow to do by hand, then try to make a program to do it
for you. I guess as soon as you come with real proof, people might even
start listening to you. I'm no mathematician, so I'm in no position to
judge your method. The way to prove it to someone like me would be to
actually break RSA. I'm sure you would gain everybody's respect if you
would do it. So? Do it.

Matthijs.

Relevant Pages

  • Re: Surrogate factoring, update
    ... James Harris wrote: ... > It's been a while since I mentioned surrogate factoring, ... actually break RSA. ...
    (sci.math)
  • Re: Surrogate factoring, update
    ... > actually break RSA. ... Here and now though, there's this idea I'm tossing around, and it's at ... At the beginning, there's little certainty, much guessing, and not a ... James Harris ...
    (sci.math)
  • Re: Surrogate factoring, update
    ... > actually break RSA. ... Here and now though, there's this idea I'm tossing around, and it's at ... At the beginning, there's little certainty, much guessing, and not a ... James Harris ...
    (sci.crypt)
  • Re: Surrogate factoring, update
    ... >From: jstevh@msn.com (James Harris) ... >> composite of two primes, ... >> actually break RSA. ...
    (sci.math)