Analisis Performa Kecepatan Algoritma Dual Modulus RSA dalam Pengamanan Data Teks dengan Python

This study analyzes the performance of the Dual Modulus RSA algorithm in securing text data using Python. The rapid growth of digital technology has increased the risk of data security threats, making efficient and secure encryption essential. Dual Modulus RSA is a modification of the classic RSA algorithm that uses two different moduli in the encryption and decryption process, thus increasing security levels because attackers must factorize two moduli simultaneously. This research uses an experimental quantitative approach by measuring the execution time of encryption and decryption processes with variations in plaintext length (5, 10, and 15 characters). Implementation was carried out using Python 3 with the time.perf_counter() function for microsecond-precision measurement. The results show that the Dual Modulus RSA algorithm successfully encrypts and decrypts all test plaintexts correctly. Encryption time ranged from 0.0212 ms to 0.0823 ms, while decryption time ranged from 0.0422 ms to 0.0955 ms. There is a positive linear relationship between plaintext length and processing time. Decryption is consistently slower than encryption due to the larger private key exponent (d1=2753, d2=3533) compared to the public exponent (e=17). The main factors affecting performance are exponent size, dual modulus overhead, CPU caching effects, and Python interpretation overhead. This study recommends using Dual Modulus RSA with hybrid encryption for practical implementation to balance security and performance.