Re: (new?) factorization technique
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: (new?) factorization technique

From: Risto Lankinen <rlankine@hotmail.com>
Date: Thu Jun 02 2005 - 12:28:59 CEST

"vector" <root@localhost> wrote in message
news:BcCdnek9X-PGqwPfRVn-vg@comcast.com...
>
> I wonder about something no one has said yet, though. Does this procedure
> have a name? You know, something along the lines of "Unvor-Gyvable Növis
> Factorization Method" or similar? Apparently I should have found all this
> and more with a simple Google search, but like I said, I never saw it
> documented anywhere (which did surprise me). So, what is this called?

"Lankinen's recursive factoring algorithm" returns a handful of hits
from Google newsgroups, and "Lankinen's recursive factorization
algorithm" from the web. This is essentially the same algorithm in
binary [base-2] as yours.

 - Risto -
Received on Thu Sep 29 21:39:37 2005