High-Throughput Montgomery Modular Multiplication
R.V. Kamala, M. Srinivas · 2006
The efficiency of public key encryption schemes like RSA and elliptic curve cryptography can be improved using fast modular multiplication schemes. In this paper, the authors propose an efficient Montgomery modular multiplication technique that employs multi-bit shifting and carry-save addition to perform long-integer arithmetic and hence conventional lengthy additions required at each stage are avoided. The corresponding hardware realization is optimal in terms of delay and offers high data throughput compared to the recently proposed designs while it occupies slightly more area. The optimization is technology independent and thus should suit well for not only FPGA implementation but also ASIC. The design has been evaluated on Virtex2 series FPGA for practical bit lengths of 512,1024 and 2048 bit