A fast algorithm for multiplicative inversion in GF(2/sup m/) using normal basis

Authors :: K. Takagi
Naofumi Takagi
J. Yoshiki
Source :: IEEE Transactions on Computers. 50:394-398
Publication Year :: 2001
Publisher :: Institute of Electrical and Electronics Engineers (IEEE), 2001.
Abstract: A fast algorithm for multiplicative inversion in GF(2/sup m/) using normal basis is proposed. It is an improvement on those proposed by Itoh and Tsujii and by Chang et al., which are based on Fermat's theorem and require O(logm) multiplications. The number of multiplications is reduced by decomposing m-1 into several factors and a small remainder.

Subjects :: Fermat's Last Theorem
Discrete mathematics
Multiplicative function
Fast algorithm
GF(2)
Inversion (discrete mathematics)
Theoretical Computer Science
Normal basis
Finite field
Computational Theory and Mathematics
Hardware and Architecture
Remainder
Software
Mathematics

Full Text Access

Tools