Future Intelligent Information Systems

Volume 86 of the series Lecture Notes in Electrical Engineering pp 23-30

High Radix Montgomery Multipliers for Residue Arithmetic Channels on FPGAs

  • Yinan KongAffiliated withDepartment of Electronic Engineering, Macquarie University

* Final gross prices may vary according to local VAT.

Get Access


This work targets an efficient Montgomery Modular Multiplier for use in the channels of a Residue Number System (RNS). It is implemented on FPGA and optimized by attempting and evaluating the high radix techniques of the Montgomery Algorithm. The usual correction shift step at the end is proved to be infeasible. The resulting multiplier achieves 15ns for a modular multiplication using high radix without correction shift.


Montgomery Modular Multiplication the Residue Number System FPGA Digital Arithmetic Public-Key Cryptosystems