Issue No. 09 - September (1998 vol. 47)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.713315
<p><b>Abstract</b>—Inversion over Galois fields is much more difficult than the corresponding multiplication. In this article, efficient computation of inverses in GF(2<super><it>m</it></super>) is considered by solving a set of linear equations over the ground field GF(2). The proposed algorithm uses two separate bases for the representation of its input and output elements and has low computational complexity. The algorithm is also suitable for hardware implementation using VLSI technologies.</p>
Computer arithmetic, Euclid's algorithm, Galois (or finite) fields, multiplicative inverses, canonical (or polynomial) basis and triangular basis.
M. A. Hasan, "Double-Basis Multiplicative Inversion Over GF(2m)," in IEEE Transactions on Computers, vol. 47, no. , pp. 960-970, 1998.