[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 #85 from Jacob Lifshay <programmerjake at gmail.com> ---
I added python implementations for all the gfp* instructions, as well as tests
(which pass).

I also added descriptions of the FFT twin mul-adds (all 3 of them) so that I
could finish deleting the redundant sections.

According to Wikipedia, NTT is the correct name only for GF(p) (or other rings
of integers mod m with some restrictions), the others are just weird DFTs.
https://en.wikipedia.org/wiki/Discrete_Fourier_transform_(general)#Number-theoretic_transform

It occurred to me, that the gfp* instructions should really be named the
modular arithmetic instructions, since they're all useful for composite moduli
too. GF(p) is only defined if p is a prime. gfpinv will have more inputs than
just zero that don't work if the modulus isn't a prime.

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