Studi Perbandingan Algoritma LUC dan Algoritmavincent-Sathiyamoorthy RSA dalam Pengamanan Data Digital

Abstract

In contemporary digital cryptography, the public key method is known. In public key cryptography, encryption and decryption keys are required. The public key algorithms used to secure messages are the LUC algorithm and the Vincent- Sathiyamoorthy RSA algorithm. In solving the LUC algorithm there is a simple public key generation by multiplying a specified prime number for the key n. To determine e, a relatively prime number is sought. The relative prime number is found using the modulo division function. The private key generation involves finding d and requires the public key e. Data encryption is done using the public key (e, n) and decryption transforms the encoded data using the private key (d, n). The Vincent-Sathiyamoorthy RSA key generation involves only one prime number and other values are non-prime numbers. To obtain n variables such as p, q, r, s, t and e are needed. Private key generation depends on variables p, u and t in the public key generation. In the encryption and decryption processes, the Vincent- Sathiyamoorthy RSA algorithm is faster than the LUC algorithm. In testing the encryption and decryption processes using the .doc file extension with different character lengths, it can be concluded that the longer the characters length processed during encryption and decryption, the longer the encryption and decryption processes take.