Calculates the affine transformation right * left + imm8 inside the finite field GF(2^8).
right is an 8x8 bit matrix, left and imm8 are bit vectors.
If inverse is set, then the inverse transformation with respect to the reduction polynomial
x^8 + x^4 + x^3 + x + 1 is performed instead.
Multiplies packed 8-bit integers in left and right in the finite field GF(2^8)
and store the results in dst. The field GF(2^8) is represented in
polynomial representation with the reduction polynomial x^8 + x^4 + x^3 + x + 1.
See https://www.corsix.org/content/galois-field-instructions-2021-cpus for details.