[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 #52 from Jacob Lifshay <programmerjake at gmail.com> ---
(In reply to Luke Kenneth Casson Leighton from comment #50)
> > it would be a ring of truncated polynomials with GF(2) coefficients. A Ring
> > is any math thing that has addition, multiplication, and works kinda like
> > the integers in that it has an additive identity 0, and a multiplicative
> > identity 1, and iirc associativity and commutativity. Rings can be made of
> > things that are totally not integers, like here, where they are truncated
> > polynomials.
> 
> surprisingly, i get the Ring thing. i used it for a cryptographic algorithm
> in 2003.  numbers that repeat, and are unique within their set, and
> by a beautiful coincidence happen to have consistent arithmetic.

repetition isn't needed for a Ring, the consistent arithmetic part is the
important part.

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