Arithmetic operations in \(GF(2^ m)\)
The paper is concerned with the efficient computation of multiplicative inverses and of exponentiations in \(GF(2^ m)\) by exploiting a normal basis representation of the field. The method used for exponentiation is suited to parallel computation.
efficient computation of multiplicative inverses
scientific article; zbMATH DE number 164962