Re: Surrogate factoring, a fascinating idea

From: Tom St Denis (tomstdenis_at_iahu.ca)
Date: 06/10/04 

Date: Thu, 10 Jun 2004 19:41:42 GMT

James Harris wrote:
> So my previous post was just kind of over the top, so this one will be
> a lot more restrained.
>
> What's happened is that I looked at the problem of factoring in an
> entirely different way, as given some target M, if it's large with
> only two large prime factors THAT is the issue: having only two large
> prime factors.
>
> My idea is to shift to factoring some other number which has *many*
> prime factors, and then from that factorization factor the original
> "hard" target.
>
> It's such a simple idea that the mathematics outlining it is just
> basic algebra.
>
> What may be the first surprise is that the algebra allows such a
> method.
>
> But it does.

Really? Wow!!! That's amazing! Do share more of your insightful
factoids with us!

> I didn't want to come back to Usenet as my experience here is that
> there are always Usenet posters who are angry and loud who will post
> post post and reply reply reply trying their best to obscure the
> message and drown out someone who has new ideas while *viciously*
> insulting them.

The jist of what people are telling you is "put up or shut up." Nobody
cares for the random off-thoughts of one James Harris. This isn't
alt.james.harris. This is sci.crypt. If you have ideas and wish to
*discuss* them [not simply tell us them then ignore all non-positive
feedback] then go ahead. Otherwise shut the f1@# up already.

It's quite simple. Here are your steps for getting decent positive
attention

1. Write out your algorithm in a proper enumerated fashion. e.g.

step 1. take M and produce M = tk + jM^4 ... [etc]
step 2. ... etc

Such that if you follow the algorithm step for step [without outside
input e.g. no "determine these the solution to this equation"] you
either end up with the factors or you can determine it has failed [e.g.
won't be able to factor].

2. Implement your algorithm and factor 100 to 200 bit RSA style
composites.

3. Sumarize step #1 and #2 in a paper and publish it here.

If you can't even follow that simple plan you don't deserve any positive
attention because you *are* trolling.

Tom

Relevant Pages

  • Re: My prime counting formula, other prime counting
    ... >> In sci.math, James Harris ... >> New or not, Christian Bau's algorithm, as far as I can tell, ... Christian Bau's algorithm still beats yours. ... > And in fact Christian Bau just did his own implementation from the ...
    (sci.math)
  • Re: My prime counting formula, other prime counting
    ... >> In sci.math, James Harris ... >> New or not, Christian Bau's algorithm, as far as I can tell, ... Christian Bau's algorithm still beats yours. ... > And in fact Christian Bau just did his own implementation from the ...
    (sci.physics)
  • Re: JSH: They lie
    ... James Harris wrote: ... I emailed Professor Plotnikov to ask about his ... it was found that the algorithm has cycling on some instances. ... an undirected graph. ...
    (sci.crypt)
  • Re: Surrogate factoring, reasons for my concerns
    ... James Harris wrote: ... minutes) which generates 100 random pairs of primes, ... the algorithm is worthless in its present form. ... you call yourself a professional programmer but you're too lazy yourself to write a little ...
    (sci.crypt)
  • Re: Surrogate factoring, reasons for my concerns
    ... James Harris wrote: ... minutes) which generates 100 random pairs of primes, ... the algorithm is worthless in its present form. ... you call yourself a professional programmer but you're too lazy yourself to write a little ...
    (sci.math)