Re: New way to factor? Yes!

From: David Kastrup (dak_at_gnu.org)
Date: 02/08/05


Date: Tue, 08 Feb 2005 14:04:47 +0100

jstevh@msn.com writes:

> Now I want to appeal to reason, once again.

Of course, to that purpose you have to call out to the rest of the
world, as it is no longer residing with you.

> I have found a new way to factor, as I can show in a few lines:
>
> Take the two quadratics
>
> yx^2 + Ax - M^2 = 0
>
> and
>
> yz^2 + Az - j^2 = 0

[...]

> and that is very important as it is completely different from most
> previously known factoring methods--
>
> (See
> http://mathworld.wolfram.com/PollardRhoFactorizationMethod.html)

Better compare it with Fermat's method.

> --where most reduce to a square root dependent on the factors of
> your target number (while Pollard's Rho method I think does not).

"Rho" is imagery for running an iterated function into a cycle. It is
an algorithm that is pretty easy to understand.

But you ought to look at Fermat instead.

> Now if you are really smart you may be able to create fast
> algorithms from what I've just shown using factorizations of j and
> T, but the full theory I'm developing is even better, as in fact, it
> is easy to prove that you actually only need the factorization of T.
>
> And I call T the surrogate, and the method surrogate factoring.

So far, we have been shown all of
a) it does not behave like you predict
b) it does not work
c) it is not efficient
d) it most certainly is not polynomial in the bit size.

> However, in this case, if rapid development of this idea can take
> place, then the world as you know it will change, and petty social
> crap from a small group of people changing the world in such a way
> is just such a pitiful way for humanity to go out.
>
> What should happen? Well, some people in authority need to pay
> attention to this method before it bites the world in the ass.

The ass that gets bitten has been pretty consistent the same for years
on end.

-- 
David Kastrup, Kriemhildstr. 15, 44793 Bochum


Relevant Pages

  • Re: New way to factor? Yes!
    ... > your target number (while Pollard's Rho method I think does not). ... an algorithm that is pretty easy to understand. ... > algorithms from what I've just shown using factorizations of j and ... > And I call T the surrogate, and the method surrogate factoring. ...
    (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)
  • Re: Basically a sieve method, relation to quantum
    ... > Xcott Craver wrote: ... then why not run your algorithm on ALL of the ... > as I call it recursively to do all the factorizations, ... How do you get the original primes from the above factorisation? ...
    (sci.crypt)
  • Re: (new?) factorization technique
    ... >> factorizations. ... I don't know if the technique is original, ... But Vector's algorithm is well-suited to distributed processing, ... farmed out to an exponentially-increasing number of computers and completed ...
    (sci.crypt)
  • Re: Basically a sieve method, relation to quantum
    ... > Xcott Craver wrote: ... then why not run your algorithm on ALL of the ... > as I call it recursively to do all the factorizations, ... How do you get the original primes from the above factorisation? ...
    (sci.math)

Quantcast