Re: A factoring algorithm
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: A factoring algorithm

From: Joseph Ashwood <ashwood@msn.com>
Date: Sun Jan 08 2006 - 00:28:23 CET

<hart_wb@yahoo.com> wrote in message
news:1136613824.569396.118650@o13g2000cwo.googlegroups.com...
> I have a new factoring algorithm which seems to be very fast with
> certain kinds of numbers.

Any advances, or even new paths in factoring is always a welcome advance. If
your algorithm is as fast as you say, it is likely that new qualifications
may need to be created for RSA keys, this is a well established area of
advancement, and will be appreciated. Even if it results in triviality as
Amling and Carmody have said the knowledge the an additional avenue is
available is often very useful.
                    Joe
Received on Tue Jan 17 16:49:02 2006