Generalization of RSA cryptosystem based on 2<i>n</i> primes

Abstract

<abstract><p>This article introduced a new generalized RSA crypto-system based on <inline-formula><tex-math id="M2">\begin{document}$ 2n $\end{document}</tex-math></inline-formula> prime numbers called generalized RSA (GRSA). This is a modern technique to provide supreme security for the computer world by factoring the variable<inline-formula><tex-math id="M3">\begin{document}$ N $\end{document}</tex-math></inline-formula>, where its analysis process has become much easier nowadays with the development of tools and equipment. <inline-formula><tex-math id="M4">\begin{document}$ 2n $\end{document}</tex-math></inline-formula> 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 <inline-formula><tex-math id="M5">\begin{document}$ 2n $\end{document}</tex-math></inline-formula> primes which are not easily broken, <inline-formula><tex-math id="M6">\begin{document}$ 2n $\end{document}</tex-math></inline-formula> primes are not comfortably demented. This method provides greater performance and fidelity over the network system.</p></abstract>