A Scalable Architecture for RSA Cryptography on Large FPGAs
Authors:
- 1 April 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 331-332
Abstract
The authors propose an improvement to a limited resource Montgomery multiplier design, the MWR2MM algorithm proposed by Tenca and Koc, which is suitable for implementation on large FPGAs. The design can be scaled to utilize available FPGA multipliers, CLB logic and frequencies of operationKeywords
This publication has 2 references indexed in Scilit:
- A scalable architecture for modular multiplication based on montgomery's algorithmIEEE Transactions on Computers, 2003
- Modular Multiplication Without Trial DivisionMathematics of Computation, 1985