Quantum hacking is now possible with Shor’s Algorithm implementation
It is very time consuming problem to find the integer factors of a large odd number. However, the algorithms success depends on a computer with a large number of quantum bits. The prime factors, or multipliers, are three and five. Certain algorithms for quantum computers are able to outperform their classical counterparts, reads the papers abstract. However, it was far from scalable. (Note that the lower limit on RSA keys is 1024 bits, or 309 decimal digits....