The enhancement of computation technique by combining RSA and El-Gamal Cryptosystems

Abstract

Cryptography addresses the necessary elements for secure communication such as privacy, confidentiality, key exchange, authentication, and non-repudiation. This paper proposes a model satisfies the security based on the combination of the RSA and El-Gamal Cryptosystems. The RSA Cryptosystem is depends on the Integer Factorization Problem (IFP), while the El-Gamal Cryptosystem depends on Discrete Logarithm Problem (DLP). This model works on the basis of merging between IFP with DLP give a good speed of computation for asymmetric cryptosystem based on difficulties of the solutions of two famous hard problems. As a result, the computation of the proposed system is more efficient compared to El-Gamal algorithm and RSA algorithm.