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.)
Changs team did it in five atoms each representing a qubit.
They were able to hold each atom is superposition by two energy streams at the same time.
They performed logic gates (parts of Shors algorithm) on four of the five atoms using lasers.
We see no physical reason why that is not going to be in the cards.
And that doesnt bode well for encrypted information.
Therefore, to implement Shors algorithm is comparable to the Hello, World of classical computing.
source: www.techworm.net
