![]() |
Available news archives:
comp.lang.tcl
-
comp.lang.python
-
comp.security.firewalls
-
sci.crypt -
comp.lang.php -
comp.lang.javascript
|
|
sci.crypt archiveRe: Latest factoring idea, might work
From: <jstevh@msn.com>
Date: Sun Apr 30 2006 - 20:39:08 CEST
Dave Turner wrote:
Well, there's a real problem in that I no longer can bring myself to
But with this new idea, it's so much simpler than my previous ones that
The gist of it is easy. With C = p_1 p_2, then the difference of
My latest research result will let you find information about it as a
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?
Well, my result lets you find ab mod n_1, where n_1 is some natural you
If so, it is easily implementable, and I'm waiting to see if there is
It's a simple idea, but I have to think it possible that it doesn't
If it does work, then, well, it's a simple idea, easily implemented.
James Harris
|