RSA Cryptosystem with Parallel Thread Execution using Dual Public Keys

In the need for computer security, number theory and more specifically the Rivest–Shamir–Adleman (RSA) techniques are essential to assure safe data transfer. A crucial component for protecting sensitive information when users and websites communicate is the encryption and decryption process. The encryption and decryption procedures employ keys. Modular exponentiation is a technique used by the public key RSA cryptosystem to encrypt and decrypt communications. However, the fact that the public key is communicated through a public channel raises questions about RSA’s security, leading to the usage of chaos to improve data security. Various applications use customized variants of the RSA algorithm to increase efficiency and security, including voice and picture encryption. In this paper, the proposed method shows that RSA encryption uses threads and dual public keys to reduce execution time when compared to regular RSA cryptosystems.