Cryptographers 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 computes 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 ...

Read More