[Fastlibnt-devel] Scalar multiplication

[William H. <ha...@ya...>]

Although I can think of a faster algorithm for scalar
multiplication of a polynomial by a multi-limb
integer, I can't think of anything faster than the
naieve algorithm for scalar multiplication by a single
limb. 

Therefore I am just going to go ahead and implement
the naive algorithm for multiplication by an ui or si.


It occurred to me what scalar division by a limb ought
to do. It will just do integer division of each
coefficient by the single limb, i.e. we won't have the
result over the rationals, but over the integers. I'm
not sure how useful that actually is in real
algorithms, but I guess we should have it.

But there I have a feeling that there will be a faster
algorithm than the naieve one if the polynomial is
long enough, etc.

Bill.

__________________________________________________
Do You Yahoo!?
Tired of spam?  Yahoo! Mail has the best spam protection around 
http://mail.yahoo.com