Desperate Log

The existing algorithm for GF((2^n)^m) is only for n = 2^i and m = 2^j.
And GF with those restrictions don’t have ONB2 representation.

Oh well.

Advertisements