@article{Shah2023, 
author = {Tariq Shah and Muhammad Zohaib and Qin Xin and Bander Almutairi and Muhammad Sajjad},
title = {Generalization of RSA cryptosystem based on 2n primes},
year = {2023},
journal = {AIMS Mathematics},
volume = {8},
number = {8},
pages = {18833-18845},
keywords = {encryption, decryption, key generation, primes, RSA cryptosystem, public key, generalized RSA cryptosystem, private key},
url = {https://www.sciopen.com/article/10.3934/math.2023958},
doi = {10.3934/math.2023958},
abstract = {This article introduced a new generalized RSA crypto-system based on    2  n prime numbers called generalized RSA (GRSA). This is a modern technique to provide supreme security for the computer world by factoring the variable   N, where its analysis process has become much easier nowadays with the development of tools and equipment.    2  n primes (prime numbers) are used in the GRSA crypto-system to provide security over the network system. This includes encryption, key generation, and decryption. In this method we used    2  n primes which are not easily broken,    2  n primes are not comfortably demented. This method provides greater performance and fidelity over the network system.}
}