GF(7) Elementwise multiplication needs further optimization.

I used a  logic friday boolean logic optimization software to attempt to find an optimal set  element wise multiplication (Hadamard).   Unfortunately, this yielded disappointing results for the moment, not less than 70 bit operations.   Possible ways to optimize include temporary bit slice during multiplication.   This would mean that for the duration of the equation, the elements could be operated on as if they had four bits instead of three.   Such as was first suggested here http://arxiv.org/abs/0901.1413 for GF(5), though a better representation has since been found for GF(5).