Title :
Fast inversion in composite Galois fields GF((2n)m )
Author :
Guajardo, Jorge ; Paar, Christof
Author_Institution :
CTE Cyber Trust Solutions, Needham, MA, USA
Abstract :
We describe an improvement of Itoh and Tsujii´s algorithm for inversion over Galois fields GF((2n)m). In particular, raising an element to the 2ln 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
Keywords :
Galois fields; computational complexity; information theory; polynomials; algorithm; composite Galois fields; fast inversion; inversion complexity; multiplications; polynomial basis representation; Costs; Galois fields; Hamming weight; Optimization methods; Polynomials;
Conference_Titel :
Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Conference_Location :
Cambridge, MA
Print_ISBN :
0-7803-5000-6
DOI :
10.1109/ISIT.1998.708900
