Re: (new?) factorization technique
From: Risto Lankinen (rlankine_at_hotmail.com)
Date: 06/02/05
- Next message: Greg Smythe: "Re: Bittorrent Question"
- Previous message: tum_: "Montgomery Exponentiation (RSA) question"
- In reply to: vector: "Re: (new?) factorization technique"
- Next in thread: Risto Lankinen: "Re: (new?) factorization technique"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: Thu, 02 Jun 2005 10:28:59 GMT
"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 -
- Next message: Greg Smythe: "Re: Bittorrent Question"
- Previous message: tum_: "Montgomery Exponentiation (RSA) question"
- In reply to: vector: "Re: (new?) factorization technique"
- Next in thread: Risto Lankinen: "Re: (new?) factorization technique"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|