Parallelizing Multi-Keys RSA Encryption Algorithm Using OpenMP

The RSA algorithm is an asymmetric encryption algorithm used to ensure the confidentiality and integrity of data as it travels across networks. Security has grown in importance over time, resulting into more data requiring encryption. Parallelization represents an ideal solution to speed up the encr...

Full description

Saved in:
Bibliographic Details
Published in2022 14th International Conference on Computational Intelligence and Communication Networks (CICN) pp. 778 - 782
Main Authors Alzaher, Reem, Hantom, Wafa, Aldweesh, Alanoud, Allah, Nasro Min
Format Conference Proceeding
LanguageEnglish
Published IEEE 04.12.2022
Subjects
Codes
Decryption
Dynamic scheduling
Encryption
Heuristic algorithms
Libraries
OpenMP
Parallel processing
Parallel Programming
Private Key
Processor scheduling
Public Key
RSA
Online AccessGet full text

Cover

More Information
Summary:The RSA algorithm is an asymmetric encryption algorithm used to ensure the confidentiality and integrity of data as it travels across networks. Security has grown in importance over time, resulting into more data requiring encryption. Parallelization represents an ideal solution to speed up the encryption and decryption processes. An advance implementation of RSA using parallelization concept leads to improve security and performance. In this paper, we represent a parallelized version of Multi-Keys RSA algorithm implemented using OpenMP library. Furthermore, we provide parallel implementation of Multi-Keys RSA under both static and dynamic scheduling with different chunk sizes, and our experimental results show that static scheduling is more optimum for RSA cryptography as compared to dynamic. As a final result, we have achieved an average speed up of 4.4 and efficiency of 0.7.
ISSN:2472-7555
DOI:10.1109/CICN56167.2022.10008237