Consider RSA’s (Rivest–Shamir–Adleman) solution, which is based on finding the prime multipliers of a very large number. Fortunately for security purposes, the amount of computing power needed to determine these multipliers in a short amount of time remains theoretical. Quantum computing, with processing speeds that leave binary computers in the dust, will render this solution obsolete, as hackers will have almost unlimited computing power to solve these problems.