Enhancing Parallel Implementation of RSA Algorithm using OpenMP

Abstract

The Rivest-Shamir-Adleman (RSA) method is commonly used to ensure secure data transmission. However, RSA's encryption and decoding methods need significant processing resources, which can strain computing capacity. To address this issue, we offer a parallel implementation of the RSA algorithm based on OpenMP, a popular shared-memory parallelism API. A series of trials show that our parallel implementation outperforms its sequential equivalent in terms of execution times. Our investigation focuses primarily on the achieved speedup on a multi-core CPU, with an examination of how thread count affects the performance of our parallel solution. This study demonstrates the power of parallel computing in optimizing the RSA method for speedier data transmission.