An enhanced parallel version of RSA public key crypto based algorithm using openMP

Due to increased data movement and information exchange over internet and web, preserving data confidentiality and security has emerged as a prime concern for the end users. From bank transactions to document verification portals, from government official websites to social media, all these platforms share data remotely over web which contains certain confidential information and thus uses security mechanisms based on cryptographic algorithm to preserve the confidentiality of data preventing any information leakage or breach. RSA being the most popular public key cryptography based algorithm uses data encryption and decryption technique. It uses the mathematical concept of factorization of prime integers. The efficiency of the algorithm in terms of enhancing the security aspect to guess the factors of prime numbers increase when the numbers have high powers. Computing prime factors of these large numbers is compute intensive task where the serial programming makes RSA algorithm to slow down. The paper here presents an OpenMP based algorithmic modification to the code of RSA algorithm to improve the execution time using the parallel processing power of modern day multi-core architecture based machines. Experimental results under the lights of graphical representation shows a considerable speed up gained over the traditional implementation. Further the paper also compares the efficiency with other parallel implementations of RSA algorithm where the reported algorithm is found to perform almost equivalent to the GPGPU based implementation without the need of extra hardware in the form of graphics card and with reduced power consumption of the machine. The paper sums up with a conclusion that GPU based acceleration can be clubbed with proposed method to generate factors severely large prime numbers making it highly difficult to guess the factors.