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.
Inhaltsverzeichnis (Table of Contents)
- Abstract
- I. Introduction
- A. Literature Review
- B. Persis Urbana Ivy, Purshotam Mandiwa. Mukesh Kumar
- II. Original RSA Algorithm
- A. Key Generation Phase
- B. Encryption Phase
- C. Decryption Phase
- D. A simple Encryption example of RSA
- 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
Zielsetzung und Themenschwerpunkte (Objectives and Key Themes)
The objective of this study is to enhance the RSA algorithm's security and improve its encryption and decryption speeds. This is achieved by introducing modifications to the original algorithm and utilizing a cloud-based database for key storage.
- Improved RSA Algorithm Security
- Enhanced Encryption and Decryption Speed
- Use of Proth, Mersenne, and Balanced Prime Numbers
- Cloud-Based Key Storage and Management
- Comparative Analysis with the Original RSA Algorithm
Zusammenfassung der Kapitel (Chapter Summaries)
I. Introduction: This chapter introduces the context of the research, highlighting the increasing reliance on internet security and the need for robust cryptographic techniques. It emphasizes the widespread use of the RSA algorithm and the motivation for improving its speed and security, referencing existing literature on modifications and limitations of the original RSA algorithm. The chapter sets the stage by emphasizing the importance of addressing the challenges posed by the computational complexity and security vulnerabilities of the original RSA algorithm.
II. Original RSA Algorithm: This chapter details the workings of the original RSA algorithm, outlining its key generation, encryption, and decryption phases. It explains the mathematical principles underpinning the algorithm, including the selection of prime numbers, calculation of the modulus, and the generation of public and private keys. A simple example illustrates the encryption and decryption process. The chapter also discusses the algorithm's significance, its restrictions (message size limitations), and its limitations (speed, susceptibility to attacks, key distribution issues, and the potential threat posed by a solution to the Riemann hypothesis).
III. Problem Definition: This section focuses on the limitations of the original RSA algorithm, primarily its slow speed due to high computational complexity and its vulnerability to various attacks like factorization and common modulus attacks. It clearly states the need for improvement in both speed and security, setting the stage for the proposed solution in subsequent chapters.
IV. Proposed Technique: This chapter presents the core methodology of the improved RSA algorithm. It details the use of four prime numbers—a Proth number, a Mersenne prime, and two balanced primes—to enhance security. The chapter thoroughly explains each prime number type and its role in strengthening the algorithm. A key feature is the integration of a cloud-based database for storing key parameters, thereby accelerating the encryption and decryption processes. The chapter outlines the key generation, encryption, and decryption phases of the proposed algorithm, emphasizing the use of key indices retrieved from the database instead of direct key parameter usage.
V. 4-Prime RSA Algorithm: This chapter elaborates on the advantages of using four prime numbers instead of two in the RSA algorithm. It explains how this modification leads to faster decryption, referencing prior research on the computational cost reduction associated with using multiple primes. The choice of Proth and Mersenne primes, alongside balanced primes, is justified to mitigate the potential disadvantage of having smaller factors in the modulus.
VI. Cloud Based Storage of Key Parameters: This chapter discusses the benefits of using a cloud-based database for storing key parameters in the proposed algorithm. It outlines various advantages of cloud databases compared to traditional databases, including ease of access, scalability, disaster recovery capabilities, control options, database technology choices, and enhanced security. The chapter emphasizes how this approach contributes to faster execution and improved security by eliminating the need for real-time key generation during data transmission.
Schlüsselwörter (Keywords)
Proth Number, Mersenne Prime Number, RSA, cryptography, cloud based database, balanced prime, encryption, decryption, security, speed, algorithm, modular exponentiation, key generation, public key, private key, factorization attack, common modulus attack.
Frequently Asked Questions: Enhanced RSA Algorithm Using Four Prime Numbers and Cloud-Based Key Storage
What is the main objective of this study?
The primary goal is to improve the RSA algorithm's security and speed. This is accomplished by modifying the original algorithm and employing a cloud-based database for key storage.
What are the key themes explored in this research?
The study focuses on enhancing RSA algorithm security, improving encryption/decryption speeds, utilizing Proth, Mersenne, and balanced prime numbers, implementing cloud-based key management, and comparing the modified algorithm with the original RSA algorithm.
What are the key components of the original RSA algorithm covered?
The research details the key generation, encryption, and decryption phases of the original RSA algorithm. It also examines its significance, restrictions (message size limitations), and limitations (speed, vulnerability to attacks, key distribution challenges, and potential threats from solving the Riemann hypothesis).
What are the limitations of the original RSA algorithm addressed in this study?
The study addresses the original RSA algorithm's slow speed due to high computational complexity and its vulnerability to attacks like factorization and common modulus attacks.
What is the proposed technique to enhance the RSA algorithm?
The proposed method uses four prime numbers—a Proth number, a Mersenne prime, and two balanced primes—to enhance security. It integrates a cloud-based database for key parameter storage, accelerating encryption and decryption.
How does the use of four prime numbers improve the RSA algorithm?
Using four primes (Proth, Mersenne, and two balanced primes) leads to faster decryption and mitigates the risk of smaller factors in the modulus, thus enhancing security. The choice of these specific prime types is justified based on their properties and computational advantages.
What is the role of the cloud-based database in this improved RSA algorithm?
The cloud-based database stores key parameters, eliminating the need for real-time key generation during data transmission. This improves speed and security by providing ease of access, scalability, disaster recovery, and enhanced control options compared to traditional databases.
What types of prime numbers are used in the improved RSA algorithm, and why?
The improved algorithm utilizes Proth, Mersenne, and balanced prime numbers. The selection is based on their specific mathematical properties that contribute to enhanced security and computational efficiency.
What is the overall impact of the proposed modifications on the RSA algorithm?
The modifications result in a more secure and faster RSA algorithm, addressing the limitations of the original algorithm regarding speed and vulnerability to certain attacks. The cloud-based key storage further enhances efficiency and security.
What are the key words associated with this research?
The key words include: Proth Number, Mersenne Prime Number, RSA, cryptography, cloud-based database, balanced prime, encryption, decryption, security, speed, algorithm, modular exponentiation, key generation, public key, private key, factorization attack, common modulus attack.
- 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
