O(log2 m) iterative algorithm for multiplicativeinversion in GF(2m)
Morioka, S.
Katayama, Y.
Tokyo Res. Lab., IBM Res., Kanagawa;
This paper appears in: Information Theory, 2000. Proceedings. IEEE International Symposium on
Publication Date: 2000
On page(s): 449-
Meeting Date: 06/25/2000 - 06/30/2000
Location: Sorrento, Italy
ISBN: 0-7803-5857-0
References Cited: 2
INSPEC Accession Number: 6794311
Digital Object Identifier: 10.1109/ISIT.2000.866747
Current Version Published: 2002-08-06
Abstract
A new algorithm that can calculate the multiplicative inverses in
GF(2m) with O(log2 m) iterations is presented.
While this algorithm requires in total the same number of
multiplications ([log2(m-1)]+Hw(m-1)-1) with the best known
algorithm, the latency, if mapped to a hardware, can be reduced
significantly ([log2(m-2)]+1), comparable to the best case
result, which is implemented using Fermat's little theorem
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
