Implementation of the montgomery modular based RSA algorithm on FPGA

Kurniasari, Esti and Putra, Agfianto Eko and Gella Agoestien, Nia (2019) Implementation of the montgomery modular based RSA algorithm on FPGA. In: 5th International Conference on Science and Technology, ICST.

[thumbnail of Implementation_of_the_Montgomery_Modular_based_RSA_Algorithm_on_FPGA.pdf] Text
Implementation_of_the_Montgomery_Modular_based_RSA_Algorithm_on_FPGA.pdf
Restricted to Registered users only

Download (553kB) | Request a copy

Abstract

Lifting and modulus operations are the main operations on the RSA algorithm which require long computation time. Implementation of the operation of the lift and modulus on hardware devices requiring more resources than other arithmetic operations. Montgomery modular multiplication, the method which can be used to simplify the operation of lift and modulus, is implemented on FPGA, to speed up the computing process. The implementation results in this study, which is done using VHDL on the Xilinx Artix 7 series FPGA, were able to work at a maximum frequency of 133.76 MHz, requiring 17.66 LUT (11, 195 of 63, 400) and 7.14 of IOBs (15 of 210). © 2019 IEEE.

Item Type: Conference or Workshop Item (Paper)
Additional Information: Cited by: 4
Uncontrolled Keywords: Arithmetic operations; Computation time; Computing process; Hardware devices; Maximum frequency; Montgomery; Montgomery modular multiplication; RSA algorithms; Field programmable gate arrays (FPGA)
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: Faculty of Mathematics and Natural Sciences > Computer Science & Electronics Department
Depositing User: Sri JUNANDI
Date Deposited: 19 Oct 2026 07:27
Last Modified: 19 Oct 2026 07:27
URI: https://ir.lib.ugm.ac.id/id/eprint/29220

Actions (login required)

View Item
View Item