The purpose of this study is to improve the strength of RSA Algorithm and at the same time improving the speed of encryption and decryption. RSA algorithm is named after Ron Rivest, Adi Shamir and Len Adleman, who invented it in 1977-78. The RSA crypto-system is the most widely- used public key cryptography algorithm in the world. Its security is based on the difficulty of factoring large integers. This paper presents an improved RSA algorithm which is superior to the original RSA algorithm in terms of strength of encryption and speed of encryption and decryption. This includes the strengthened form of RSA algorithm along with the architecture of the proposed algorithm. A cloud based database is used store the keys in advance. The modified RSA algorithm is compared on various aspects with the original RSA algorithm and the proposed algorithm certainly improve the strength and speed of computation.
Table of Contents
I. Introduction
A. Literature Review
B. Persis Urbana Ivy, Purshotam Mandiwa. Mukesh Kumar proposed a novel approach “A modified RSA cryptosystem based on ‘n’ prime numbers”
II. Original RSA Algorithm
A. Key Generation Phase
B. Encryption Phase
C. Decryption Phase
D. A simple example of RSA Encryption
E. Significance of RSA Algorithm
F. Restriction of RSA Algorithm
G. Limitations of RSA Algorithm
III. Problem Definition
IV. Proposed Technique
A. Proth Number
B. Mersenne Prime Number
C. Balanced Prime Numbers
D. Key Generation
E. Encryption Phase
F. Decryption Phase
V. 4-Prime RSA Algorithm
VI. Cloud Based Storage of Key Parameters
VII. Architecture of Proposed Technique
VIII. Flowchart of the proposed algorithm
IX. Experiment and Results
X. Comparison Analysis Between Proposed RSA Algorithm VS Original RSA Algorithm
XI. Conclusion
Objectives and Research Themes
This study aims to enhance the security and computational efficiency of the RSA cryptographic algorithm by integrating a four-prime architecture with cloud-based storage for key parameters. The research addresses the inherent slowness of traditional RSA and its susceptibility to specific security threats by utilizing specialized prime number types.
- Optimization of RSA encryption and decryption speeds.
- Implementation of a four-prime factor modulus (Proth, Mersenne, and Balanced primes).
- Utilization of cloud-based database systems for secure and efficient key parameter management.
- Comparison of computational complexity and performance between the proposed technique and the original RSA algorithm.
- Strengthening the algorithm against factorization and other common cryptographic attacks.
Excerpt from the Book
III. Problem Definition
RSA Algorithm is very slow due to the computational complexity of the numbers. The RSA encryption as well as decryption requires one modular exponentiation. If the RSA modulus n is a k-bit number, then, typically d is also a k-bit number. Decryption requires k squaring and k/2 multiplication modulo n. For example, if a 1024-bit number is the RSA modulus, there are 1024 squaring and 512 multiplications. Due to the large decryption exponent size, the RSA algorithm is very slow.
The RSA algorithm is also prone to security attacks such as factorisation attack, common modulus attack and other attacks. The RSA can fall apart and its security can be compromised. However, the speed of computation as well as the security can be improved by the proposed method. This improvement is achieved by using a cloud based database to store the key parameters instead of calculating them at the time of transmission of data. Also, the security is improved by passing key indexes instead of actual key parameters and using four prime numbers instead of two. One of the prime number is a Proth Number and one is a Mersenne Prime Number, other two being balanced prime numbers.
Summary of Chapters
I. Introduction: Provides an overview of the necessity of network security and evaluates existing research on modified RSA approaches.
II. Original RSA Algorithm: Details the standard RSA key generation, encryption, and decryption phases with an illustrative example.
III. Problem Definition: Identifies the computational inefficiency and security vulnerabilities of the original RSA algorithm.
IV. Proposed Technique: Explains the methodology of using four specific types of prime numbers and a novel key management strategy.
V. 4-Prime RSA Algorithm: Discusses the rationale behind using four distinct primes and the benefits for decryption speed.
VI. Cloud Based Storage of Key Parameters: Describes the integration of cloud platforms like MongoDB to enhance performance and security.
VII. Architecture of Proposed Technique: Outlines the document-oriented database structure used for managing the keys.
VIII. Flowchart of the proposed algorithm: Presents the visual representation of the encryption and decryption workflow.
IX. Experiment and Results: Compares the performance metrics of the proposed algorithm against the original RSA.
X. Comparison Analysis Between Proposed RSA Algorithm VS Original RSA Algorithm: Summarizes the key differences and improvements of the proposed method.
XI. Conclusion: Synthesizes the research findings, highlighting the achieved improvements in speed and security.
Keywords
Proth Number, Mersenne Prime Number, RSA, cryptography, cloud based database, balanced prime, encryption, decryption, network security, algorithm optimization, MongoDB, computational complexity, modular exponentiation, prime factorization.
Frequently Asked Questions
What is the core focus of this research paper?
The paper focuses on improving the standard RSA algorithm by increasing its encryption and decryption speeds and enhancing its security against common attacks.
What are the central themes of the work?
The central themes include cloud-based key storage, optimized modular arithmetic, and the use of special prime numbers to replace random ones.
What is the primary objective of the proposed algorithm?
The primary goal is to reduce decryption time and improve the strength of the RSA algorithm by utilizing four prime numbers instead of two.
Which scientific methodology is employed?
The research uses a comparative experimental methodology, implementing the proposed approach in Python and measuring the time taken for encryption and decryption relative to the original RSA.
What topics are covered in the main section?
The main sections cover the limitations of original RSA, the properties of Proth, Mersenne, and Balanced primes, and the architecture of a cloud-based storage system for key indices.
Which keywords characterize this paper?
The paper is characterized by terms such as Proth Number, Mersenne Prime, RSA, cryptography, and cloud-based database.
How does the cloud database specifically improve the algorithm?
The cloud database allows for the storage of key parameters beforehand, meaning that only index values are passed during transmission, which reduces real-time computational load.
Why are Proth and Mersenne primes used in the 4-prime approach?
They are used to overcome the vulnerabilities associated with using smaller factors for the common modulus, providing greater security than choosing random prime numbers.
What is the significance of the "4-prime" architecture compared to the original?
The 4-prime architecture allows for faster decryption processes and increases the multiplicative complexity, which strengthens the system against factorization attacks.
- Quote paper
- Aditya Kumar (Author), 2019, Improved RSA Algorithm based on cloud database using Proth Number and Mersenne Prime Number, Munich, GRIN Verlag, https://www.grin.com/document/511690
