Analisis Performa Dari Algoritma Kriptografi Rsa Dan Elgamal Dalam Enkripsi Dan Dekripsi Pesan

Cryptography is one of the most important things in computer science because it is related to data security or message security. Cryptographic algorithms are used to secure a message, the most popular of which are the Rivest-Shamir-Adleman (RSA) and ElGamal algorithms. ElGamal employs a prime number modulo while RSA employs the factorial of two large integer numbers. The workings of these two algorithms are distinct, and each has distinct advantages. Even though the two algorithms use different processes, they can both encrypt and decrypt a message. There are speed factors of execution time and peak memory when running the encryption and decryption process. One of these two factors is hardware, which determines the environment that will be used. According to the findings of this study, the RSA algorithm has a faster execution time than ElGamal. In terms of peak memory, both algorithms get the result similarly, with the same peak memory results shown

Linear Generalized ElGamal Encryption Scheme

International audienceElGamal public key encryption scheme has been designed in the 80's. It is one of the first partial homomorphic encryption and one of the first IND-CPA probabilistic public key encryption scheme. A linear version has been recently proposed by Boneh et al. In this paper, we present a linear encryption based on a generalized version of ElGamal encryption scheme. We prove that our scheme is IND-CPA secure under linear assumption. We design a generalized ElGamal scheme from the generalized linear. We also run an evaluation of performances of our scheme. We show that the decryption algorithm is slightly faster than the existing versions