Re: JSH: Your funeral



JSH wrote:
I picked factoring because ultimately I don't need any of you to do
your jobs.

So my job is ultimately impacted by factoring? I doubt that.

All I have to do is factor an RSA challenge number and the theory I
now have says that with time I can do it.

"With time." The latest number factored, RSA-200, took about 75 years of computer time using the best known factoring algorithms. As far as anyone can tell, your algorithm runs about as slow as a random GCD algorithm (I make the note as far as anyone can tell -- your explanations as to how to factor S and produce n and k are very lacking).

Now laugh at that all you want. Show your continuing bravado against
mathematical proof.

Show us your *watertight* proof and we will stop laughing. But we haven't seen it.

You people do not know mathematics which is why you are being beaten
in this way.

Ditto.

And the point now is that you are not mathematicians, you lie
stupidly, and there was no other way to get the truth out so you stand
against human progress and the only way to prove it was to put you
against a wall and crush you with the truth.

You have not yet provided sufficient evidence. I give you a challenge. Solve RSA-704 by the end of September. If you can do it, I congratulate you. If you cannot, then you will admit that your algorithm is not worth anything and you denounce the rank of mathematician. Deal?
.



Relevant Pages

  • Re: JSH: Your funeral
    ... your jobs. ... computer time using the best known factoring algorithms. ... your algorithm runs about as slow as a random GCD algorithm (I ...
    (sci.math)
  • Re: JSH: Your funeral
    ... your jobs. ... computer time using the best known factoring algorithms. ... your algorithm runs about as slow as a random GCD algorithm (I ...
    (sci.math)
  • Re: JSH: Your funeral
    ... computer time using the best known factoring algorithms. ... your algorithm runs about as slow as a random GCD ... discoverer then yeah, maybe you should worry. ...
    (sci.math)
  • Re: JSH: Your funeral
    ... computer time using the best known factoring algorithms. ... your algorithm runs about as slow as a random GCD ... never find a way to prove that with some super dramatic discovery ... discoverer then yeah, maybe you should worry. ...
    (sci.math)
  • Re: Suggestions for double-hashing scheme
    ... i.e. the multiplicative group might be of size /2 if p is ... That's what my algorithm is for. ... > factorizations of N-1, which may or may not be fast. ... mathematical proof of primeness that it constructs is understandable. ...
    (comp.programming)