Parallelized RSA Algorithm: An Analysis with Performance Evaluation using OpenMP Library in High Performance Computing Environment

RSA algorithm is an asymmetric encryption algorithm used to maintain confidentiality and integrity of data as it is transported across networks. As time has gone on, security and confidentiality has grown in importance leading to more data requiring encryption. Parallelization has become an important aspect in improving the speed and efficiency of processing for encryption algorithms. Improvements in parallel implementations of the RSA algorithm lead to better security and efficiency for parallel systems utilizing the algorithm. In this study, we present a comprehensive survey of methods proposed by researchers for parallelization of the RSA algorithm from 1978 till date. This survey aims to provide a deeper understanding of the possible avenues that can be considered to obtain better performance of the RSA algorithm in parallel environments. To demonstrate the improvements, this paper presents a parallel CPU-based implementation of the RSA algorithm using the OpenMP library. This implementation focuses on parallelizing the exponentiation operation of the algorithm. To provide a robust analysis, the study makes use of a High Performance Computing environment to illustrate results for different scenarios in terms of parallel processing units. Through experimental analysis, the implementation is shown to have greatly improved execution times when compared against serial implementation.