Title :
A fast algorithm for multiplicative inversion in GF(2m) using normal basis
Author :
Takagi, Naofumi ; Yoshiki, Jun-ichi ; Takagi, Kazuyoshi
Author_Institution :
Dept. of Inf. Eng., Nagoya Univ., Japan
fDate :
5/1/2001 12:00:00 AM
Abstract :
A fast algorithm for multiplicative inversion in GF(2m) 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
Keywords :
Galois fields; cryptography; error correction codes; Fermat´s theorem; O(logm) multiplications; multiplicative inversion; normal basis; Computer Society; Cryptography; Error correction codes; Galois fields; Iterative algorithms;
Journal_Title :
Computers, IEEE Transactions on
