Analisis dan implementasi algoritme 3 DES secara paralel

Abstract

One of the data encryption algorithm known since 1977 is Data Encryption Standard (DES). One of the DES algorithm variants since 1999 is 3DES algorithm. In 3DES, DES algorithm is used three times for encryption and decryption process with different key for each test. The encryption and decryption computational time for DES main algorithm grows proportionally with the increasing size of input block plaintext and ciphertext. In this research, parallel processing is applied by dividing the data to several processes, so that the encryption and decryption process against blocks of data run in parallel. The Message Passing Interface is used for presenting parallelization of 3DES algorithm. The objectives of this research is to implement and analyze the complexity and the perfomance of 3DES algorithm both serially and parallelly. The mode of operation used for running 3DES algorithms is Electronic CodeBook (ECB). The analysis performed in this research includes the analysis of performance metrics and the experimental results of the 3DES algorithm both serially and parallelly. The results of this research are summarized as follows: 1. The execution of serial 3DES algorithm for encryption and decryption for files with greater sizes give longer time. For example, a file size of 4,009,016 bytes takes the encryption or decryption computational times about 957.87 seconds or 15.97 in minutes. 2. Parallelization of 3DES algorithm in the Electronic CodeBook mode performed in domain decomposition, that is input blocks are distributed to some processes that will work in parallel. However, the code containing I/O function is unparallelizable, because the access to memory is, by its very nature, sequential. 3. The speedup of 3DES parallel program grows proportionally with the increasing size of files until a certain limit. 4. To obtain a fixed value of efficiency in 3DES parallel programs, the size of the input block in this case (n) should be increased by 2p2 + p log2 p fold. The maximum efficiency value from 3DES parallel programs is absolutely one.