Re:Quantum Computer Comes Closer to Cracking RSA Encryption
by akarve on Tuesday March 08, 2016 @09:48AM
(#11245504)
that is in part what this discovery is about: how to read out and disentangle the solution from superposition. the roots of the answer to your question are in "shor's algorithm," which is the original proposal for factoring integers in polynomial time with high probability.
[ Parent
| on HN ]
Re:Quantum Computer Comes Closer to Cracking RSA Encryption
by DropbearRob on Tuesday March 08, 2016 @11:58AM
(#11246529)
thanks akarve, I shall read abot "shor's algorithm"