Re: Basically a sieve method, relation to quantum

From: Xcott Craver (caj_at_B-r-a-i-n-H-z.com)
Date: 01/22/05 

Date: Sat, 22 Jan 2005 22:24:14 GMT

<jstevh@msn.com> wrote:
>Mark Nudelman wrote:
>>
>> I'm not sure why that's astounding. There are lots of algorithms
>> that factor numbers 100% of the time.
>
>Yeah but my algorithm does it in polynomial time.
 
       Then, factor an RSA challenge.
 
       If it works 50% of the time, try it on a bunch of challenge
       numbers, and give us the factors of at least one.
 
       If you had such an algorithm, it would be incredibly easy to
       prove it by doing the above.

>James Harris
                                                     --Xcott

Relevant Pages
Loading