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

Fajrin, Ahmad Miftah and Benedict, Jeremy Richard and Kusuma, Henry Jayanata (2023) Analisis Performa Dari Algoritma Kriptografi Rsa Dan Elgamal Dalam Enkripsi Dan Dekripsi Pesan. Jurasik (Jurnal Riset Sistem Informasi dan Teknik Informatika), 8 (1). pp. 91-98. ISSN 2527-5771; Online ISSN 2549-7839

PDF (ANALISIS PERFORMA DARI ALGORITMA KRIPTOGRAFI RSA DAN ELGAMAL DALAM ENKRIPSI DAN DEKRIPSI PESAN) 545-1111-1-SM.pdf - Published Version Download (932kB)

Abstract

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.

Item Type:	Article
Uncontrolled Keywords:	Cryptography, RSA, ElGamal, Execution time, Peak Memory
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science Q Science > QA Mathematics > QA76 Computer software
Divisions:	Faculty of Engineering > Department of Informatic
Depositing User:	AHMAD MIFTAH FAJRIN
Date Deposited:	02 Mar 2023 02:14
Last Modified:	02 Mar 2023 02:14
URI:	http://repository.ubaya.ac.id/id/eprint/43531

Actions (login required)

View Item