Fast inversion in composite Galois fields GF((2/sup n/)/sup m/)
Jorge Guajardo, Christof Paar · 2002
We describe an improvement of Itoh and Tsujii's algorithm for inversion over Galois fields GF((2/sup n/)/sup m/). In particular, raising an element to the 2/sup ln/ power, l an integer, in polynomial basis representation can be done with a binary, fixed matrix. Finally, we show that the inversion complexity is essentially given by the number of multiplications.