An Efficient VLSI Architecture for Rivest-Shamir-Adleman Public-key Cryptosystem

機構典藏 > College of Engineering > Graduate Institute & Department of Electrical Engineering > Journal Article > Item 987654321/52822

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/52822

Title:	An Efficient VLSI Architecture for Rivest-Shamir-Adleman Public-key Cryptosystem
Authors:	江正雄;Chiang, Jen-shiun;簡丞志;Chien, Cheng-chih;Chen, Jian-kao;周信國;Chou, Hsin-guo
Contributors:	淡江大學電機工程學系
Keywords:	Data Security;H-algorithm;L-algorithm;Modular Exponentiation;Modular Multiplication;Montgomery's Algorithm;Public-key Cryptosystem;RSA;VLSI
Date:	2004-12-01
Issue Date:	2010-12-01 10:35:56 (UTC+8)
Publisher:	臺北縣：淡江大學
Abstract:	In this paper, a new efficient VLSI architecture to compute modular exponentiation and modular multiplication for Rivest-Shamir-Adleman (RSA) public-key cryptosystem is proposed. We modify the conventional H-algorithm to find the modular exponentiation. By this modified H-algorithm, the modular multiplication steps for n-bit numbers are reduced by 5n/18 times. For the modular multiplication a modified L-algorithm (LSB first) is used. In the architecture of the modified modular multiplication the iteration times are only half of Montgomery's algorithm and the H-algorithm. The proposed architecture for the RSA public-key crypto-system has a data rate of 146 kb/s for 512-b words with a 200-MHz clock rate.
Relation:	淡江理工學刊=Tamkang journal of science and engineering 7(4)，頁241-250
DOI:	10.6180/jase.2004.7.4.07
Appears in Collections:	[Graduate Institute & Department of Electrical Engineering] Journal Article

Files in This Item:

File	Size	Format
1560-6686_7-4-7.pdf	341Kb	Adobe PDF	282	View/Open