[Libre-soc-bugs] [Bug 782] add galois field bitmanip instructions

[bugzilla-daemon at libre-soc.org]

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

--- Comment #72 from Jacob Lifshay <programmerjake at gmail.com> ---
(In reply to Luke Kenneth Casson Leighton from comment #71)
> https://www.nayuki.io/page/number-theoretic-transform-integer-dft
> https://www.nayuki.io/res/number-theoretic-transform-integer-dft/
> numbertheoretictransform.py
> 
> well, i am a blithering idiot.  NTT uses prime modulo arithmetic.

that's GF(p) FFT.

I expect carry-less FFT and GF(2^n) FFT to be useful as well.

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