FPGA versus ASIC Implementation of Radix-8 Scalable Montgomery Modular Multiplier. | ||||
MEJ- Mansoura Engineering Journal | ||||
Article 2, Volume 32, Issue 3, September 2007, Page 1-16 PDF (1.85 MB) | ||||
Document Type: Research Studies | ||||
DOI: 10.21608/bfemu.2020.128684 | ||||
View on SCiNiTO | ||||
Authors | ||||
Atef A. Ibrahim* 1; Hamed A. ElSemary2; Amen M. Nassar3 | ||||
1Electronics Research Institute., Cairo., Egypt. | ||||
2Electronics Research Institute, Cairo, Egypt. | ||||
3Cairo University, Cairo, Egypt | ||||
Abstract | ||||
Traditional ASIC implementations have the well known draw-back of reduced flexibility compared to software implementations. Since modern security protocols are increasingly defined to be algorithm independent, a high degree of flexibility with respect to the cryptographic algorithms is desirable. A promising solution which combines high flexibility with the speed and physical security of traditional hardware is the implementation of cryptographic algorithms on reconfigurable devices such as FPGA. In this paper we compare - in terms of area and speed- FPGA implementation of radix-a scalable Montgomery modular multiplier using retiming technique with ASIC implementation for different word sizes of operands. The simulation data were generated using Mentor Graphics CAD tools. | ||||
Keywords | ||||
Montgomery Multiplication; Scalability; FPGA Implementation; ASIC Implementation; Cryptography | ||||
Statistics Article View: 105 PDF Download: 162 |
||||