Generalization of RSA cryptosystem based on 2n primes
Tariq Shah, Muhammad Zohaib, Qin Xin, Bander N. Almutairi, Muhammad Sajjad · AIMS Mathematics · 2023
This article introduced a new generalized RSA crypto-system based on \begin{document}$ 2n $\end{document} prime numbers called generalized RSA (GRSA). This is a modern technique to provide supreme security for the computer world by factoring the variable \begin{document}$ N $\end{document} , where its analysis process has become much easier nowadays with the development of tools and equipment. \begin{document}$ 2n $\end{document} 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 \begin{document}$ 2n $\end{document} primes which are not easily broken, \begin{document}$ 2n $\end{document} primes are not comfortably demented. This method provides greater performance and fidelity over the network system.