Perbandingan Performa Algoritma Kriptografi Asimetris RSA dan ElGamal pada Sistem Data Digital

Aprilita, Ahista Agave (2026) Perbandingan Performa Algoritma Kriptografi Asimetris RSA dan ElGamal pada Sistem Data Digital. Other thesis, Institut Teknologi Sepuluh Nopember.

Text 5002221111-Undergraduate_Thesis.pdf - Accepted Version Restricted to Repository staff only Download (22MB) | Request a copy

Abstract

Perkembangan teknologi informasi yang pesat meningkatkan pertukaran data digital, namun juga membawa ancaman kejahatan siber seperti pencurian identitas dan manipulasi data sensitif. Kriptografi asimetris menjadi solusi penting dalam pengamanan data, dengan RSA dan ElGamal sebagai dua algoritma yang paling banyak digunakan. Penelitian ini bertujuan membandingkan performa dan keamanan kedua algoritma berdasarkan efisiensi waktu enkripsi/dekripsi, penggunaan memori, serta ketahanan terhadap serangan Brute Force dan Pollard’s Rho. Penelitian menggunakan data uji berupa teks dengan enam variasi panjang (100 hingga 50.000 karakter) dan delapan variasi panjang kunci (16-bit hingga 2048-bit). Sistem pengujian dibangun dengan antarmuka GUI menggunakan Python dan library tkinter, sympy, serta tracemalloc. Pengujian performa mengukur waktu eksekusi dan penggunaan memori puncak, sedangkan analisis keamanan menggunakan simulasi serangan Brute Force dan Pollard’s Rho dengan batas maksimum 1.000.000 iterasi. Hasil penelitian menunjukkan RSA unggul dalam kecepatan enkripsi dengan rata-rata 74% lebih cepat dari ElGamal karena penggunaan public exponent e = 65537 (17-bit), sedangkan ElGamal harus melakukan dua operasi perpangkatan dan pembangkitan acak per karakter. Pada dekripsi, RSA tetap lebih cepat untuk kunci 16-512 bit, namun keunggulannya tergerus pada kunci 1024-2048 bit hingga hanya 24,8%. Penggunaan memori ElGamal hampir dua kali lipat RSA pada enkripsi akibat struktur ciphertext (c1, c2) dengan kompleksitas O(2n), sedangkan RSA O(n). Terhadap serangan Brute Force, kunci 16-bit dan 32-bit sangat rentan, sedangkan kunci 64-bit ke atas aman secara praktis. Terhadap Pollard’s Rho, RSA 64-bit masih dapat dipecahkan dalam 116,83 ms karena faktor prima terkecil 32-bit, sedangkan ElGamal 64-bit tidak dapat dipecahkan dalam 1 juta iterasi karena kompleksitas logaritma diskrit O(232). Kesimpulannya, RSA direkomendasikan untuk prioritas kecepatan enkripsi dan efisiensi memori, sedangkan ElGamal cocok untuk skalabilitas dekripsi pada kunci sangat besar atau ketahanan terhadap Pollard’s Rho pada kunci menengah. Penggunaan kunci minimal 128-bit, atau lebih baik 2048-bit, sangat dianjurkan untuk menjamin keamanan data.
===================================================================================================================================
The rapid development of information technology has increased digital data exchange, but also brings the threat of cybercrime, such as identity theft and sensitive data manipulation. Asymmetric cryptography has become an important solution for data security, with RSA and ElGamal being the two most widely used algorithms. This study aims to compare the performance and security of the two algorithms based on encryption/decryption time efficiency, memory usage, and resistance to Brute Force and Pollard’s Rho attacks. The study used test data in the form of text with six different lengths (100 until 50,000 characters) and eight different key lengths (16-bit until 2048-bits). The test system was built with a GUI interface using Python and the tkinter, sympy, and tracemalloc libraries. Performance testing measured execution time and peak memory usage, while security analysis used Brute Force and Pollard’s Rho attack simulations with a maximum limit of 1,000,000 iterations. The research results show that RSA excels in encryption speed, with an average of 74% faster than ElGamal due to its use of a public exponent e = 65537 (17-bit), whereas ElGamal requires two exponentiation operations and random generation per character. In decryption, RSA remains faster for 16-bit until 512-bit keys, but its advantage erodes for 1024-bit until 2048-bit keys, dropping to only 24.8%. ElGamal’s memory usage is almost double that of RSA for encryption due to its (c1, c2) ciphertext structure, which has a complexity of O(2n), while RSA’s is O(n). Against brute-force attacks, 16-bit and 32-bit keys are highly vulnerable, while 64-bit keys and above are practically secure. Against Pollard’s Rho, 64-bit RSA can still be broken in 116.83 ms due to the 32-bit smallest prime factor, while 64-bit ElGamal cannot be broken in 1 million iterations due to the O(232) discrete logarithm complexity. In conclusion, RSA is recommended for prioritizing encryption speed and memory efficiency, while ElGamal is suitable for decryption scalability on very large keys or resistance to Pollard’s Rho on medium keys. Using a key of at least 128-bits, or preferably 2048-bits, is highly recommended to ensure data security.

Item Type:	Thesis (Other)
Uncontrolled Keywords:	RSA, ElGamal, Kriptografi Asimetris, Brute Force, Pollard's Rho, Keamanan Data, Performa Algoritma RSA, ElGamal, Asymmetric Cryptography, Brute Force, Pollard's Rho, Data Security, Algorithm Performance
Subjects:	Q Science > QA Mathematics
Divisions:	Faculty of Mathematics, Computation, and Data Science > Mathematics > 44201-(S1) Undergraduate Thesis
Depositing User:	Ahista Agave Aprilita
Date Deposited:	31 Jul 2026 01:43
Last Modified:	31 Jul 2026 01:43
URI:	http://repository.its.ac.id/id/eprint/137370

Actions (login required)

View Item