Re: But what if it works?

From: mike3 (mike4ty4_at_yahoo.com)
Date: 12/12/04


Date: Sun, 12 Dec 2004 22:19:42 GMT

Also, if you have an actual factoring algorithm, then I suggest that once
you
get it working, no matter how many YEARS it takes, I want you to factor the
following number (RSA-2048):

25195908475657893494027183240048398571429282126204
03202777713783604366202070759555626401852588078440
69182906412495150821892985591491761845028084891200
72844992687392807287776735971418347270261896375014
97182469116507761337985909570009733045974880842840
17974291006424586918171951187461215151726546322822
16869987549182422433637259085141865462043576798423
38718477444792073993423658482382428119816381501067
48104516603773060562016196762561338441436038339044
14952634432190114657544454178424020924616515723350
77870774981712577246796292638635637328991215483143
81678998850404453640235273819513786365643912120103
97122822120720357

It will be equal to the product of two primes. When your "revolutionary"
"WOOHOO!" algorithm is done, tell me what it gave for the two
prime number factors, which are of roughly equal bit length. Even if it
takes
so many YEARS to make, ONCE you have a WORKING algorithm, then
FACTOR the above number with it and tell me what you get. If you do,
(and the two factors multiply together to give that exact number) then you
will have proven that you have a REVOLUTIONARY factoring algorithm,
even if you do NOT disclose it.

Therefore, if you still wish to keep it secret, then just provide the two
prime
factors of that number to prove your capability.

<jstevh@msn.com> wrote in message
news:1102865859.137984.94370@z14g2000cwz.googlegroups.com...
> I've been posting about some new research where I'm investigating this
> REALLY SIMPLE idea for factoring integers, and I'm doing my usual
> process, which involves posting as I work through an idea looking for
> errors.
>
> Usually there are errors, and with something like this, usually there
> are serious errors that kill the idea.
>
> But what if this idea works?
>
> I keep telling myself that it'd be really odd if it were this simple,
> as how could I find it when no one has for hundreds if not thousands of
> years?
>
> But what if, despite all of that, it works?
>
> My usual process is to toss out new ideas, and see if posting reveals
> to me a fatal flaw, as often it does. Over time I work and re-work an
> idea, and my best, most solid works took YEARS in this process to come
> together.
>
> Like advanced polynomial factorization? Over two years of effort to
> get that fully worked out, and more like 4, and if you count out all
> the antecedents work on it kind of goes back to 1995.
>
> Prime counting was much faster but it took MONTHS to work that out, and
> even to clear out all the errors, and get a good hold on how it all
> worked out. I'd say it was over two years, from May 2002 when I made
> the discovery, until I felt I had a good handle on it, and had cleared
> out all the errors in how I looked at it.
>
> This factoring idea is about, oh, three days old. It's a baby. It
> just doesn't fit the pattern for me to just bam, get it, right off the
> bat.
>
> So I'm looking to be playing with this for months, maybe even years,
> down the road, still looking for some basic factoring idea, but, what
> if works?
>
> Well, if it works, then there's a fairly good chance that no one will
> know it, which is kind of hilariously funny. So, even if it works,
> there's probably no early concerns.
>
> If it does work though, I should probably stop talking about it. But
> it's early in the process. Time will tell.
>
>
> James Harris
>



Relevant Pages

  • Re: Ultimate check, new way to factor or not?
    ... polynomial time. ... a new factoring algorithm. ... Greg Rose ...
    (sci.crypt)
  • Re: JSH: SF Algorithm
    ... Why would they change their minds between now and then? ... easily factoring the RSA challenges, you are now beginning to express ... partial factorization are ... Correct me if I am wrong, but the point of the factoring algorithm ...
    (sci.math)
  • Re: JSH: Not obvious? Simple math test.
    ... factoring algorithm. ... increment alpha by 1 and go to step 2. ... Diophantine equation solutions that follow from the factoring ...
    (sci.crypt)
  • Re: A factoring algorithm
    ... > I have a new factoring algorithm which seems to be very fast with ... Your post lacks specifics. ... then this factorization is readily found in polynomial time ...
    (sci.crypt)
  • Re: Diophantine
    ... I decided to use uppercase letters for constants, ... Your other posting about "factoring" lets me conclude that this ... needs to be congruent L modulo 10... ...
    (sci.math)