An Efficient Decryption Method for RSA Cryptosystem

doi:10.1109/AINA.2005.97

淡江大學機構典藏 > 工學院 > 資訊工程學系暨研究所 > 會議論文 > Item 987654321/37613

請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/37613

題名:	An Efficient Decryption Method for RSA Cryptosystem
作者:	Hwang, Ren-Junn;Su, Feng-Fu;Yeh, Yi-Shiung;Chen, Chia-Yao
貢獻者:	淡江大學資訊工程學系
日期:	2005-03
上傳時間:	2010-01-11 13:46:56 (UTC+8)
出版者:	Los Alamitos, California：Institute of Electrical and Electronics Engineers (IEEE)
摘要:	This paper proposes an efficient method to implement RSA decryption algorithm. RSA cryptosystem is the most attractive and popular security technique for many applications, such as electronic commerce and secure Internet access. It has to perform modular exponentiation with large exponent and modulus for security consideration. The RSA cryptosystem takes great computational cost. In many RSA applications, user uses a small public key to speed up the encryption operation. However, the decryption operation has to take more computational cost to perform modular exponentiation by this case. This paper proposes an efficient decryption method not only based on Chinese remainder theorem (CRT) but also the strong prime of RSA criterion. The proposed decryption method only takes 10% computational costs of the traditional decryption method. It also reduces 66% computational costs than that of decryption methods based on CRT only. In a word, the speed of our proposed method is almost 2.9 times faster than the decryption method based on CRT only. The proposed method enhances the performance of the RSA decryption operation.
關聯:	Advanced Information Networking and Applications, 2005. AINA 2005. 19th International Conference on, vol.1, pp.585-590
DOI:	10.1109/AINA.2005.97
顯示於類別:	[資訊工程學系暨研究所] 會議論文

文件中的檔案:

檔案	大小	格式	瀏覽次數
An Efficient Decryption Method for RSA Cryptosystem.pdf	90Kb	Adobe PDF	590	檢視/開啟
index.html	0Kb	HTML	283	檢視/開啟
index.html	0Kb	HTML	235	檢視/開啟

在機構典藏中所有的資料項目都受到原著作權保護.

TAIR相關文章

資料載入中.....