教師資料查詢 | 類別: 會議論文 | 教師: 黃仁俊 HWANG REN-JUNN (瀏覽個人網頁)

標題:An Efficient Decryption Method for RSA Cryptosystem
學年93
學期2
發表日期2005/03/28
作品名稱An Efficient Decryption Method for RSA Cryptosystem
作品名稱(其他語言)
著者Hwang, Ren-Junn; Su, Feng-Fu; Yeh, Yi-Shiung; Chen, Chia-Yao
作品所屬單位淡江大學資訊工程學系
出版者Los Alamitos, CaliforniaInstitute of Electrical and Electronics Engineers (IEEE)
會議名稱Advanced Information Networking and Applications, 2005. AINA 2005. 19th International Conference on
會議地點臺北縣, 臺灣
摘要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.
關鍵字
語言英文
收錄於
會議性質國際
校內研討會地點淡水校園
研討會時間20050328~20050330
通訊作者黃仁俊
國別中華民國
公開徵稿Y
出版型式紙本
出處Advanced Information Networking and Applications, 2005. AINA 2005. 19th International Conference on, vol.1, pp.585-590
相關連結
Google+ 推薦功能,讓全世界都能看到您的推薦!