Simplifying Shor’s Method

Our existing methods of key exchange and public key encryption are not secure within an era of quantum computers. Why? Because the hard problems they are based on, do not become hard problems anymore with quantum computers. For RSA, we create a public modulus (N) and which is the multiplication of two prime numbers (P and Q). If N is large enough (such as with 2,048 bits) and if random prime numbers are used, it is not computationally feasible…