so multiplicative inverses in GF(28 ) are of the form
b-1 = a mod m, and there is an algorithm for finding them, but if i'm just going to build a lookup table anyway, can't just check equality with m+1 or m2 + 1 when i iterate through the products?
the answer is no