Analisis dan implementasi algoritme RSA secara paralel

Abstract

RSA is an algorithm for public key cryptography. The advantage of RSA is it is difficult to be attacked. Besides that, RSA has shortcomings. For example, execution time of RSA algorithm is longer than other algorithms like DES and RC6. In this research the RSA algorithm would be parallelized by dividing the data to each processor and the performance of the RSA algorithm would be analyzed. Parallel implementation of the RSA algorithm uses Message Passing Interface (MPI).The objectives of this research is to measure and analyze the performance of parallel RSA algorithm using performance metrics. This research uses eight processors with Windows XP SP 2 as operating system. This research uses ASCII text and binary files for the experiment. The result of this research indicates that the RSA algorithm is good when it is parallelized using domain decomposition method because the RSA algorithm has a long computational process, but it has fast communication time. The best result of parallel RSA algorithm in this research is in decryption process. For example, for file size of 4.204.979 bytes, decryption execution time of sequential RSA algorithm is 4207.286 seconds, whereas using the eight process, respectively is 530.762 seconds. The speedup is 7.929 and the efficiency is 0.991. This result is good because ideally speedup is equal to the number of processors used and optimum efficiency is one. The worst result of parallel RSA algorithm is in encryption process with small file sizes. For example, for file size of 116.820 bytes, encryption execution time of sequential RSA algorithm is 0.292 seconds, whereas using the eight process, respectively is 0.066 seconds. The speedup is 4.419 and the efficiency is 0.567. This is because the RSA encryption in this research has a fast computational process, but it also has big overhead for data communication.