GF2X irreduciblePolynomial = BuildSparseIrred_GF2X(8);

GF2E::init(irreduciblePolynomial);

byte elem1[1];

byte elem2[1];

byte resultInBytes[1];

//first create a GF2X

GF2X polynomialElement1, polynomialElement2;

//use the NTL lib to create the lookup table

for(unsigned int i=0; i<256; i++)

{

elem1[0] = (byte)i;

//translate the bytes into a GF2X element

GF2XFromBytes(polynomialElement1, elem1, 1);

for(unsigned int j=0; j<256; j++){

elem2[0] = (byte)j;

GF2XFromBytes(polynomialElement2, elem2, 1);

auto result = to_GF2E(polynomialElement1) * to_GF2E(polynomialElement2);

BytesFromGF2X(resultInBytes,rep(result),1);

GF2_8LookupTable::multTable[i][j] = resultInBytes[0];

}

}