Improvement to Montgomery Modular Inverse Algorithm | IEEE Journals & Magazine | IEEE Xplore

Improvement to Montgomery Modular Inverse Algorithm


Abstract:

After a comprehensive study on the Montgomery modular inverse algorithm and its revised versions, two modified high radix algorithms are proposed which utilize higher rad...Show More

Abstract:

After a comprehensive study on the Montgomery modular inverse algorithm and its revised versions, two modified high radix algorithms are proposed which utilize higher radix to reduce iterations needed without increasing complexity much, thereby accelerating the process. The radix-4 algorithm can reduce the average number of iterations from 1.4n to 0.82n and a software experiment shows the speedup is about 11 percent and iterations are 41.5 percent less on average. The radix-8 algorithm can reduce the average number of iterations to 0.73n, but it is more complicated, which makes it suitable only for very large numbers (2,048 bits) in the experiment, where the speedup can be 13--18 percent. The proposed algorithms are suitable for software implementations on general-purpose microprocessors.
Published in: IEEE Transactions on Computers ( Volume: 55, Issue: 9, September 2006)
Page(s): 1207 - 1210
Date of Publication: 30 September 2006

ISSN Information:


Contact IEEE to Subscribe

References

References is not available for this document.