I appreciate the correction. So this is perhaps more accurately denoted as: * (A[0] * x + A[1] * x + ... A[7] * x + B). If we normalize everything to 8-bit v

I appreciate the correction. So this is perhaps more accurately denoted as: * (A[0] * x + A[1] * x + ... A[7] * x + B). If we normalize everything to 8-bit values. This is a far more powerful operation than I initially described. Where * is this pseudo-multiply (bitshift and xor) operation and + is XOR.