Abstract
The overall aim of the work presented in this paper has been to develop Montgomery modular multiplication architectures suitable for implementation on modern reconfigurable hardware. Accordingly, novel high-radix systolic array Montgomery multiplier designs are presented, as we believe that the inherent regular structure and absence of global interconnect associated with these, make them well-suited for implementation on modern FPGAs. Unlike previous approaches, each processing element (PE) comprises both an adder and a multiplier. The inclusion of a multiplier in the PE means that the need to pre-compute or store any multiples of the operands is avoided. This also allows very high-radix implementations to be realised, further reducing the amount of clock cycles per modular multiplication, while still maintaining a competitive critical delay. For demonstrative purposes, 512-bit and 1024-bit FPGA implementations using radices of 2(8) and 2(16) are presented. The subsequent throughput rates are the fastest reported to date.
Original language | English |
---|---|
Title of host publication | FPT 05: 2005 IEEE International Conference on Field Programmable Technology, Proceedings |
Editors | G Brebner, S Chakraborty, WF Wong |
Place of Publication | NEW YORK |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 13-18 |
Number of pages | 6 |
ISBN (Print) | 0-7803-9407-0 |
Publication status | Published - 2005 |
Event | 4th IEEE International Conference on Field Programmable Technology - Singapore, Singapore Duration: 11 Dec 2005 → 14 Dec 2005 |
Conference
Conference | 4th IEEE International Conference on Field Programmable Technology |
---|---|
Country/Territory | Singapore |
City | Singapore |
Period | 11/12/2005 → 14/12/2005 |
Keywords
- EXPONENTIATION
- CRYPTOSYSTEMS
- PROCESSOR