A hybrid encryption algorithm based on RSA and Diffie-Hellman

Gupta, Shilpi; Sharma, Jaya

doi:10.1109/iccic.2012.6510190

Cited by 28 publications

(15 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…According to Gupta and Sharma, some of the limitations associated with RSA include the fact that if any of p, q, e, and d is known, then the other values can be calculated, and therefore, eliminating the secrecy [1]. Also, RSA requires that the length of the message be less than bit length, otherwise the algorithm is likely to fail.…”

Section: Rsa Algorithm Limitationsmentioning

confidence: 99%

“…Compared to other symmetric cryptographic systems, RSA is relatively slow, owing to the fact that it uses public key. Also, the size of the product of the two prime numbers selected (N=P X Q) limits the length of the plain text that can be encrypted, as well as the fact that initialization of each of the RSA process required random selection of two large prime number (P and Q) [1].…”

Section: Rsa Algorithm Limitationsmentioning

confidence: 99%

“…In their work, Gupta and Sharma suggested a new hybrid encryption algorithm based on RSA and Diffie-Hellman algorithm to address some of the major security issues identified in the RSA algorithm [1]. The Diffie-Helaman algorithm (DH) was founded by Whitfield Diffie and Martin Hellman in 1976.…”

Section: A Hybrid Encryption Algorithm Based On Rsa and Diffie-hellmanmentioning

confidence: 99%

“…It is astounding and extensive algorithm that has been applied on the internet to secure different connectivity protocols. Examples of such protocols include SSL, IPsec, and SSH [1,9,11]. The method of DH lies on securely interchanging a shared secret between two parties on a public network and each party has public and private key in order to correspond on a shared secret value [10].…”

Section: A Hybrid Encryption Algorithm Based On Rsa and Diffie-hellmanmentioning

confidence: 99%

See 3 more Smart Citations

Methods toward Enhancing RSA Algorithm: A Survey

Al-Kaabi

Belhaouari²

2019

SSRN Journal

View full text Add to dashboard Cite

Cryptography defines different methods and technologies used in ensuring communication between two parties over any communication medium is secure, especially in presence of a third part. This is achieved through the use of several methods, such as encryption, decryption, signing, generating of pseudo-random numbers, among many others. Cryptography uses a key, or some sort of a password to either encrypt or decrypt a message that needs to be kept secret. This is made possible using two classes of key-based encryption and decryption algorithms, namely symmetric and asymmetric algorithms. The best known and the most widely used public key system is RSA. This algorithm comprises of three phases, which are the key generation phase, encryption phase, and the decryption phase. Owing to the advancement in computing technology, RSA is prone to some security risks, which makes it less secure. The following paper preview different proposals on different methods used to enhance the RSA algorithm and increase its security. Some of these enhancements include combining the RSA algorithm with Diffie-Hellman or ElGamal algorithm, modification of RSA to include three or four prime numbers, offline storage of generated keys, a secured algorithm for RSA where the message can be encrypted using dual encryption keys, etc.

show abstract

Section: Rsa Algorithm Limitationsmentioning

confidence: 99%

Section: Rsa Algorithm Limitationsmentioning

confidence: 99%

Section: A Hybrid Encryption Algorithm Based On Rsa and Diffie-hellmanmentioning

confidence: 99%

Section: A Hybrid Encryption Algorithm Based On Rsa and Diffie-hellmanmentioning

confidence: 99%

See 2 more Smart Citations

Methods toward Enhancing RSA Algorithm: A Survey

Al-Kaabi

Belhaouari²

2019

SSRN Journal

View full text Add to dashboard Cite

show abstract

“…Some researchers rely on algorithms combination to provide more efficient encryption algorithms by making use of the strong points and avoiding the weaknesses of these algorithms. In [16] a novel method had been proposed, it combines the most popular algorithms; RSA and Diffie-Hellman to provide more security against cryptanalysts. The two prime numbers that are generated by RSA, e and d, are used as inputs to Diffie-Hellman in order to generate the session key K which will be used for encryption and decryption.…”

Section: Related Workmentioning

confidence: 99%

An Enhanced Cryptosystem based on Shorter Keys and New Security Component

Alslaity¹,

Tran²

2017

IJCA

View full text Add to dashboard Cite

Public-key (or asymmetric key) algorithms are the most dominant cryptographic algorithms in the cryptography era. RSA, in particular, is a good example of algorithms that belong to this category which is used for many applications and its security is beyond doubt. The key size of RSA is an important factor that determines its robustness. As the computational powers evolve, the need to increase the security of cryptosystems becomes essential to achieve more robustness against cryptanalysis attacks. In the literature, the commonly used solution to achieve this goal is to increase the key size. However, in practice, keeping increasing the key size is not feasible and not unlimited; increasing the key size demands more computational power. The increase in computational power makes it hard (or impossible) to conduct the encryption process in some environments such as smart cards. Also, it should be taken into consideration that the dramatic increase in computational capabilities of new machines improves their abilities to break encryption keys. Therefore, an alternative to increasing the key size is essentially needed. In this paper, we propose a new approach for encryption that is based on RSA main algorithm while using more encryption keys with smaller sizes in addition to extra security information component (known as the Security Card, SeCa). Our results show that the use of multiple-shorter keys with the SeCa component produces significant improvements in the performance of RSA algorithm in terms of increasing security and reducing the computation overhead by decreasing encryption and decryption times. General TermsSecurity, Algorithms, Encryption.

show abstract

RSA‐Based Encryption Approach for Preserving Confidentiality Against Factorization Attacks

Raghunandan

2023

Modeling and Optimization of Optical Communication Networks

View full text Add to dashboard Cite

A hybrid encryption algorithm based on RSA and Diffie-Hellman

Cited by 28 publications

References 3 publications

Methods toward Enhancing RSA Algorithm: A Survey

Methods toward Enhancing RSA Algorithm: A Survey

An Enhanced Cryptosystem based on Shorter Keys and New Security Component

RSA‐Based Encryption Approach for Preserving Confidentiality Against Factorization Attacks

Contact Info

Product

Resources

About