3 ms·
It's a pity that this article doesn't mention Shor's Algorithm (http://en.wikipedia.org/wiki/Shor%27s_algorithm http://en.wikipedia.org/wiki/Shor%27s_algorithm)
by jgrahamc 13y ago
It's a pity that this article doesn't mention Shor's Algorithm (http://en.wikipedia.org/wiki/Shor%27s_algorithm http://en.wikipedia.org/wiki/Shor%27s_algorithm). Shor's algorithm would make integer factorization O((log n)^3).
But we have a way to go: "Also in 2012, the factorization of 21 was achieved, setting the record for the largest number factored with a quantum computer."
- mtp0101 13y agoThe article actually does mention Shor's, just not explicitly. The author introduces integer factorization as "a kind of reverse multiplication" (lol). He then explains that quantum computers can factor numbers efficiently and that this has implications for computer security.