On Calculating Multiplicative Inverses Modulo $2^{m}$
Lists
Only you see this
Abstract
This paper presents a procedure for calculating multiplicative inverses Modulo 2 m , based on a novel mathematical approach. The procedure is suitable for software implementation on a general-purpose processor. When counting the total number of word-level processor multiplications, the computational effort involved in calculating a multiplicative inverse is 2/3 that of a single multiplication of m-bit values, in addition to a few word-level multiplications. For standard processor word sizes, the number of these additional multiplications does not exceed 12. This introduces a clear advantage of the proposed method when compared to other known methods presented in the literature.
BibTeX
@article{arazi2008calculating,
author = {Ortal Arazi and Hairong Qi},
title = {{On Calculating Multiplicative Inverses Modulo $2^\{m\}$}},
journal = {IEEE Trans. Computers},
year = {2008},
url = {https://openreview.net/forum?id=OkpiLXnGD7},
}Loading related content...