Re: [Fastlibnt-devel] Scalar multiplication

[David H. <dmh...@ma...>]

On Apr 25, 2007, at 8:09 PM, William Hart wrote:

> In the case of exact division, there is a much faster
> algorithm. Simply zero all the sign limbs and divide
> the entire polynomial as a single string of limbs in
> memory by the single limb. The savings on overhead
> would be enormous, I think.

Dude that is absolutely GORGEOUS. Very very nice.

There's no reason to restrict this to single limb divisors is there?

And doesn't multiplication work like this too, if the caller  
guarantees there is enough space in each coefficient for the result?

David