Re: A factoring algorithm
- From: <wbhart@xxxxxxxxxxxxx>
- Date: Mon, 09 Jan 2006 23:15:18 GMT
"David Wagner" <daw@xxxxxxxxxxxxxxxxxxxxxxxx> wrote in message
news:dpupth$24rp$2@xxxxxxxxxxxxxxxxxxxxx
> >Many algorithms have never seen the light of day because they are not
> >better
>>than the current best algorithms at the time. For example, Lenstra once
>>told
>>me about an algorithm which would factor any number in a polynomial number
>>of arithmetic operations
>
> FYI, that one is in the literature. If you're referring to what I think,
> that was published (over two decades ago, I think) and if I recall
> correctly it is due to Adi Shamir. I can probably dig up a citation if
> you like.
>
> The catch is that the size of the numbers becomes exponentially big,
yep. Involves factorials of numbers or something IIRC.
> and consequently the cost, measured in bit operations, is exponential.
Thanks, I can find it on mathscinet. I hadn't realised it had been
published. Sheesh, the things they published back then!
Bill.
.
- Follow-Ups:
- Re: A factoring algorithm
- From: Paul Rubin
- Re: A factoring algorithm
- References:
- A factoring algorithm
- From: hart_wb
- Re: A factoring algorithm
- From: Pubkeybreaker
- Re: A factoring algorithm
- From: wbhart
- Re: A factoring algorithm
- From: David Wagner
- A factoring algorithm
- Prev by Date: Re: self-appointed expert? {Re: RS-232 random number generator}
- Next by Date: Re: Computing big numbers
- Previous by thread: Re: A factoring algorithm
- Next by thread: Re: A factoring algorithm
- Index(es):
Relevant Pages
|