Number Factoring

Quantum Algorithm

Two common cryptosystems are Rivest-Shamir-Adleman (RSA) and elliptic curve cryptography (ECC).  When you are online, any information that you exchange will be encrypted, often with these. Both of these cryptosystems are vulnerable to attacks by quantum computers.

RSA relies on the hard problem of factoring numbers.  Multiplying two prime numbers together is easy, but taking a large number and factoring it to get those two prime numbers is difficult.  

References: