Re: JSH: Nearly done

From: ošin (ošin_at_ragnarok.com)
Date: 01/27/05 

Date: Wed, 26 Jan 2005 16:31:15 -0800

> My prototype program already does that to a certain extent, so you
> could put in some huge number into it, but it'd probably take it a few
> days to process through and more than likely, it wouldn't factor.
>
> But it would process through in a few days, even with an RSA challenge
> number.
>
> That's how fast it is.

Fast? According to the timings you have quoted so far, it is horribly slower
than trial division. But unlike trial division that gives the correct result
100% of the time, you claim that surrogate factoring is at beast 50% with
tiny vaklues, and you have een said the % goes down with larger numbers.
FOAD.

> I'm focusing on building a full method that relies only on my work, so
> it has to call itself recursively to factor, and such a method can
> potentially chew through even an RSA challenge type number in minutes.

Why do you have to do it recursively. Don't you know that anything that can
be done recursively can be done non-recursively?

> Potentially this method can factor an RSA challenge sized number in
> seconds.

You have never shown that is possible. You just claim it over and over
again.

> I call that polynomial time.

Define what polynomial time means to you.

> Now, when I talk about development, I'm talking about using the method
> fully, so that it acts recursively.

Why recursively?????

Relevant Pages

  • Re: Proof factoring solution is closed form
    ... > It goes beyond just having an efficient prime-testing routine. ... I have reason to ... > And since JSH's method appears to perform worse than trial division, ... > a second that his method might indeed factor an RSA challenge? ...
    (sci.crypt)
  • Re: JSH: Nearly done
    ... a large number much faster than your program fails to do so. ... >potentially chew through even an RSA challenge type number in minutes. ... It's not what everyone else calls polynomial time. ... I don't see a mathematical reason why they should. ...
    (sci.math)
  • Re: cryptology, complexity, and quantum cryptology
    ... Alexander May. Computing the RSA secret key is deterministic ... polynomial time equivalent to factoring. ... well-known that there is a probabilistic polynomial time algorithm ...
    (sci.math)
  • Re: cryptology, complexity, and quantum cryptology
    ... Alexander May. Computing the RSA secret key is deterministic ... polynomial time equivalent to factoring. ... well-known that there is a probabilistic polynomial time algorithm ...
    (sci.logic)
  • Re: cryptology, complexity, and quantum cryptology
    ... Alexander May. Computing the RSA secret key is deterministic ... polynomial time equivalent to factoring. ... well-known that there is a probabilistic polynomial time algorithm ...
    (comp.theory)
Quantcast