About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
ISIT 2000
Conference paper
O(log2m) iterative algorithm for multiplicative inversion in GF(2m)
Abstract
A new algorithm that can calculate the multiplicative inverses in GF(2m) with O(log2m) 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 [1], 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.