Quantum computer factors numbers, could be scaled up The numbers quantum computers have been able to factor so far have NOT been very impressive, but this could all change very quickly. Running Shor's algorithm on a quantum computer is one of the easiest algorithms to run - the key is having enough qubits to do error correction and calculation. By not only running Shor's on qubits, but also making a system ...

Read MoreCryptographers HATE it! Too much math; didn’t read — Shor’s algorithm doesn’t brute force the entire key by trying factors until it finds one, but instead uses the quantum computer to find the period of a function which contains the RSA key and classically compute the greatest common divisor. RSA encryption is strong because factoring is a one-way problem. It’s very easy to multiply two primes together, but very difficult to find prime factors ...

Read More