Abstract
Recent developments suggest RSA suffers from integer factorization issues because it depends on two prime numbers. In this paper, we analyze the issues of integer factorization and suggest possible future solutions for RSA for conventional computers. Recent developments in Quantum Computing make integer factorization easier than ever. Therefore, RSA cryptography will obsolete soon after the launching of the complete quantum computer. Still, quantum computers are designed especially for particular purposes, but not for general purposes. Therefore, we analyze the enhancement mechanism of RSA till the arrival of general-purpose quantum computers. We analyze the linear RSA, multiple RSA, recursive RSA, and multiple recursive RSA in this paper. We describe these variants of RSA mathematically and analyze the feasibility of these RSA variants for the future. However, we found that reRSA is the most suitable variant of RSA.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
