Improved Montgomery modular inverse algorithm
Authors:
- 2 September 2004
- journal article
- Published by Institution of Engineering and Technology (IET) in Electronics Letters
- Vol. 40 (18) , 1110-1112
Abstract
A new, single and unified Montgomery modular inverse algorithm, which performs both classical and Montgomery modular inversion, is proposed. This reduces the number of Montgomery multiplication operations required by 33% when compared with previous algorithms reported in the literature. The use of this in practice has been investigated by implementation of the improved unified algorithm and the previous algorithms on FPGA devices. The unified algorithm implementation shows a significant speed-up and a reduction in silicon area usage.Keywords
This publication has 4 references indexed in Scilit:
- The Montgomery modular inverse-revisitedIEEE Transactions on Computers, 2000
- Analyzing and comparing Montgomery multiplication algorithmsIEEE Micro, 1996
- The Montgomery inverse and its applicationsIEEE Transactions on Computers, 1995
- Modular multiplication without trial divisionMathematics of Computation, 1985