Re: JSH: Nearly done

From: David Kastrup (dak_at_gnu.org)
Date: 01/27/05 

Date: Thu, 27 Jan 2005 02:10:27 +0100

jstevh@msn.com writes:

> 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.

Nonsense.

> Then it's just a matter of iterating through the various
> combinations, which I've figured out are at about 150 million for
> the number generated by the first 1000 primes.
>
> Potentially this method can factor an RSA challenge sized number in
> seconds.

The RSA challenge numbers are a far cry from being in the ballpark of
the first 1000 primes.

> I call that polynomial time.

In short: you are completely talking out of your ass. You are
throwing around runtime numbers which are not based on any actual
runs, you are throwing around success rates that are not based on
actual data, and you are throwing around buzzwords for which you have
no clue about the meaning. 

-- 
David Kastrup, Kriemhildstr. 15, 44793 Bochum

Relevant Pages

  • Re: Weak keys for RSA ?
    ... Robert D. Silverman RSA Public Key Validation, ... that p,q are so-called strong primes. ... outline how to guard against the Bach/Shallit ... a standard. ...
    (sci.crypt)
  • Re: SF: Back to theory
    ... you could pick up a pile of RSA challenge checks ... those upset with my saying special primes, ... Now if mathematicians were honest, good folk, who are sensible, as some ... If surrogate factoring gets quietly developed, ...
    (sci.math)
  • Re: SF: Back to theory
    ... you could pick up a pile of RSA challenge checks ... those upset with my saying special primes, ... Now if mathematicians were honest, good folk, who are sensible, as some ... If surrogate factoring gets quietly developed, ...
    (sci.crypt)
  • Re: Pell equation X^2=d*Y^2+1 where d=RSA number
    ... I think i can easily push the size of d into the RSA range. ... primes from your set, and found that in every case Y has ... interesting that you aren't using continued fractions. ... The notation i'm using always has a common factor for y and d. ...
    (sci.math)
  • Re: Riemann Hypothesis and P vs NP
    ... > about cryptography with special emphasis on RSA. ... > chapter the author mentions P versus NP since factorising numbers is a ... > discover the primes used to build the RSA codes on which the security ...
    (comp.theory)