Open AccessOptimization of RSA encryption and decryption process with distributed computing method
Author(s) -
Sofyan Arief,
Vipkas Al Hadid Firdaus,
Arief Prasetyo
Publication year - 2020
Publication title -
iop conference series. materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/830/2/022090
Subject(s) - encryption , computer science , process (computing) , probabilistic encryption , 40 bit encryption , multiple encryption , 56 bit encryption , attribute based encryption , distributed computing , theoretical computer science , computational complexity theory , public key cryptography , algorithm , computer security , operating system
Mathematics equation of the RSA is the complicated one between the other asymmetric encryption methods. It makes the RSA method needs more resources than the others. Most existing studies are trying to make another encryption method that need less computational resources, but it is less secure than using the RSA algorithm. In this paper, we proposed the Distributed Computing method to accommodate the limited computing resources in a single worker. We will distribute the computational process of RSA encryption and decryption to numerous workers. The test results showed that the implementation of Distributed Computing method made the encryption and decryption process finished faster. In conclusion, it increased completion time, made the encrypted data serve faster, and maximized the computational resources.