Perbandingan Algoritma Generalization Of The Elgamal dan Multi-Factor Rsa

Abstract

With the rapid development of technology, it is now possible to communicate over long distances by utilizing communication media, making it easier for someone to access communication media over long distances. With the ease of accessing communication media by all users, information and communication security is a new challenge related to security, accessibility, data management, and other information policy issues. Thus, it is very important to overcome sensitive issues in providing data security, which requires a method that can maintain the confidentiality of information known as cryptography. The ElGamal algorithm is one of the most widely used public-key cryptographic algorithms. which the ElGamal algorithm relies on the difficulty of calculating discrete logarithms. However, in 2021, the ElGamal algorithm was developed for the encryption process scheme to be improved in such a way that it relies on the prime factorization of the plaintext and also on a discrete logarithm problem called the generalization of the ElGamal algorithm. The Generalization of the ElGamal encryption process is based on the prime factorization of the plaintext in the exponential modulus and has a difficulty in the security that relies on discrete logarithms. Meanwhile, RSA is also the most widely used to secure website traffic, email, and several other wireless devices. Based on a large number of arithmetic modules, RSA can be slow in a limited environment. Thus, one of the variants of RSA is designed, namely multi-factor RSA, to speed up the process of decrypting RSA in software. Later in this study, we tried to compare the expansion of ciphertext as well as the complexity of both algorithms.