1!sum
2- go: GaloisFieldAffineTransform
3 commutative: false
4 documentation: !string |-
5 // NAME computes an affine transformation in GF(2^8):
6 // x is a vector of 8-bit vectors, with each adjacent 8 as a group; y is a vector of 8x8 1-bit matrixes;
7 // b is an 8-bit vector. The affine transformation is y * x + b, with each element of y
8 // corresponding to a group of 8 elements in x.
9- go: GaloisFieldAffineTransformInverse
10 commutative: false
11 documentation: !string |-
12 // NAME computes an affine transformation in GF(2^8),
13 // with x inverted with respect to reduction polynomial x^8 + x^4 + x^3 + x + 1:
14 // x is a vector of 8-bit vectors, with each adjacent 8 as a group; y is a vector of 8x8 1-bit matrixes;
15 // b is an 8-bit vector. The affine transformation is y * x + b, with each element of y
16 // corresponding to a group of 8 elements in x.
17- go: GaloisFieldMul
18 commutative: false
19 documentation: !string |-
20 // NAME computes element-wise GF(2^8) multiplication with
21 // reduction polynomial x^8 + x^4 + x^3 + x + 1.
22- go: carrylessMultiply
23 commutative: false
View as plain text