News for hackers. Stuff that matters.

A comment on Breaking RSA Security with a Low Noise D-Wave 2000Q Quantum Annealer. Parent comment

Re:Breaking RSA Security with a Low Noise D-Wave 2000Q Quant... by adrianN on Thursday May 07, 2020 @11:47AM (#23104341)
Factoring is not a constant time problem for quantum computers.
[ Parent | on HN ]
Re:Breaking RSA Security with a Low Noise D-Wave 2000Q Quant... by y04nn on Thursday May 07, 2020 @12:41PM (#23104980)
Ok, my bad, the time complexity of the Shor algorithme use in quantum computers is O((log n)^3) while your algorithm has a complexity O(n log log n). So quantum computers should be able to outperform classical computers in this task in the future.
[ Parent | on HN ]