How long can public key encryption stay secure? introducing the implications of the Riemann Hypothesis and quantum computing

As the power of computing increases, public key cryptography adapts by increasing the size of the prime numbers used by the underlying cryptographic algorithms. Public-key algorithms have been in use since the 1970s, but how long can these algorithms remain secure? In light of the emergence of quantum computing together with the prospect that the Riemann Hypothesis has been proved, this paper will investigate the possible impact on the security of current encryption algorithms. If these theoretical technological advancements become reality, what will be necessary to maintain the security of the global system? It is imperative that the security of communication is not compromised. Therefore to overcome the problem of the exponential increase in computational power of quantum computing is to use it to bolster the potential insecurities of current algorithms by developing a cryptographic system based on quantum mechanics. The Quantum Key Exchange approach demonstrates the strength of such a system. It is believed from our current understanding of quantum physics that this method is very secure and that an eavesdropper cannot intercept the key without both sender and receiver having knowledge that the key had been compromised, as the polarization will have been altered. The limitation with this system is if the intruder has connected to the channel before the communication has begun, neither sender nor receiver will be aware of the interception. Current encryption algorithms will not remain secure permanently; therefore it is essential that to maintain a secure system that cryptology constantly evolve. There are many technologies that could be used in cryptology but either of the advancements above could destroy the safeguards of current methods.