Improvement in Rebalanced CRT RSA
Journal: The International Arab Journal of Information Technology (Vol.12, No. 6)Publication Date: 2015-11-01
Authors : Seema Verma; Deepak Garg;
Page : 524-531
Keywords : Cryptography; computational complexity; encryption; public key.;
Abstract
Many improvements have been made since the RSA origin in terms of encryption/decryption speed and memory saving. This paper concentrates on the performance improvement. Rebalanced RSA is designed to improve the decryption speed at the cost of encryption speed. Further work was done to improve its encryption speed in terms of rebalanced Chinese Remainder Theorem (CRT) variants. Rebalanced CRT variants improved the encryption speed at the cost of decryption speed. This paper also improves the performance of the encryption side in rebalanced RSA, while still maintaining the same decryption speed as in rebalanced RSA by adding the multiprime RSA feature to the rebalanced CRT variant. Proposed scheme gains the same advantage in encryption side as in rebalanced CRT variants, besides it is 2 times faster at decryption side than rebalanced CRT variants. Due to the use of multiprime feature, the key generation time is also decreased in this case. It is decreased approximately by a factor of 2.39 from rebalanced RSA CRT variant. Comparison of the RSA variants with the new scheme is shown in tabular and graphical way for better analysis.
Other Latest Articles
- Model Based Approach for Content Based Image Retrievals Based on Fusion and Relevancy Methodology
- Enhancing Generic Pipeline Model for Code Clone Detection using Divide and Conquer Approach
- Using Textual Case-based Reasoning in Intelligent Fatawa QA System
- Event Extraction from Classical Arabic Texts
- A WK-Means Approach for Clustering
Last modified: 2019-11-17 16:53:51