Re: Latest factoring idea, might work
Available news archives: comp.lang.tcl - comp.lang.python - comp.security.firewalls - sci.crypt - comp.lang.php - comp.lang.javascript
Google
 
Web news.hping.org


sci.crypt archive

Re: Latest factoring idea, might work

From: Nicky <nospam@nospam.com>
Date: Mon May 01 2006 - 02:52:51 CEST

<jstevh@msn.com> wrote in message
news:1146422348.043059.252370@i40g2000cwc.googlegroups.com...
> Dave Turner wrote:
>> > Re: Latest factoring idea, might work
>>
>> Looking forward to one that does work
>
> Well, there's a real problem in that I no longer can bring myself to
> test my factoring ideas, or it might have all been over months ago.
>
> But with this new idea, it's so much simpler than my previous ones that
> it's very tempting to just call it a solution.
>
> The gist of it is easy. With C = p_1 p_2, then the difference of
> factors, p_1 - p_2, is enough information to factor C, but when do you
> know that difference?
>
> My latest research result will let you find information about it as a
> congruence, but I didn't see practical use of that, but then I had an
> idea!
>
> Force the difference.
>
> What if you multiply by ab, so you have ap_1 - bp_2 = 1?
>
> Now you've forced the difference, but how do you find ab?
>

this type of problem is too hard.
Seems you are trying to find an algorithm to factor a sub-class of numbers.
Received on Mon May 1 02:06:37 2006