[math-fun] matrix multiply over GF(2) -- yet another machine instruction we wish we had

Be nice if one could create an NxN bit-matrix (for example N=machine's wordsize) and then multiply it (mod 2) by an N-element bit vector (e.g machine word) in 1 instruction. This would help with cryptography, error correcting codes, and probably a lot of other stuff. Just saying. -- Warren D. Smith http://RangeVoting.org <-- add your endorsement (by clicking "endorse" as 1st step)