[Libre-soc-bugs] [Bug 784] Implement cl* instructions for carry-less operations

[bugzilla-daemon at libre-soc.org]

https://bugs.libre-soc.org/show_bug.cgi?id=784

--- Comment #36 from Jacob Lifshay <programmerjake at gmail.com> ---
(In reply to Jacob Lifshay from comment #34)
> I found a fast algorithm for division of polynomials with finite-field
> coefficients assuming we have fast multiplication:
> https://people.csail.mit.edu/madhu/ST12/scribe/lect06.pdf

turns out it probably won't work for cldiv/clrem because it gains its speed
through hensel lifting -- an algorithm for increasing the modulus. cldiv/clmul
requires the modulus to be fixed at exactly 2 and not to vary.

-- 
You are receiving this mail because:
You are on the CC list for the bug.