Design of a new kind of encryption kernel based on RSA algorithm

Authors:
Ping Dong;Xiangdong Shi;Jiehui Yang
Affiliations:
Information Engineer School, University of Science and Technology, Beijing, Beijing, China;Information Engineer School, University of Science and Technology, Beijing, Beijing, China;Information Engineer School, University of Science and Technology, Beijing, Beijing, China
Venue:
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part II
Year:
2005

Citing 3
Cited 0

Hardware Implementation of Montgomery's Modular Multiplication Algorithm

IEEE Transactions on Computers
A Scalable Architecture for Modular Multiplication Based on Montgomery's Algorithm

IEEE Transactions on Computers
A Hardware Algorithm for Modular Multiplication/Division

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

Fast realization of RSA algorithm by hardware is a significant and challenging task. In this paper an ameliorative Montgomery algorithm that makes for hardware realization to actualize the RSA algorithm is proposed. This ameliorative algorithm avoids multiplication operation, which is easier for hardware realization. In the decryption and digital signature process, a combination of this ameliorative Montgomery algorithm and the Chinese remainder theorem is applied, which could quadruple the speed of the decryption and digital signature compared to the encryption. Furthermore, a new hardware model of the encryption kernel based on the ameliorative Montgomery is founded whose correctness and feasibility is validated by Verilog HDL in practice.