FPGA '02 Proceedings of the 2002 ACM/SIGDA tenth international symposium on Field-programmable gate arrays
Two Hardware Implementations for the Montgomery Modular Multiplication: Sequential versus Parallel
Proceedings of the 15th symposium on Integrated circuits and systems design
Hardware Implementation of a Montgomery Modular Multiplier in a Systolic Array
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Hi-index | 0.00 |
Montgomery modular multiplication is one of the most important and frequently used techniques to accelerate the time consuming mathematical operations used in RSA cryptosystems. In this paper, a modified Montgomery modular multiplication algorithm is presented where the carry-save operations are split into two cycles so as to eliminate the generation of the data-dependent control signal from dominating the critical path. Two novel systolic Montgomery multipliers are designed based on the proposed algorithm. A bit-parallel pipelined architecture followed by a one dimensional variant are implemented on FPGA and evaluated against recently reported Montgomery multipliers implemented on the same platform. Improved results have been demonstrated in terms of area and throughput.