11 ms·
In the original paper they claim to have factored a 48-bit number with an implementation of their algorithm. Did they use some kind of trick?
by 0xf00ff00f 4y ago
In the original paper they claim to have factored a 48-bit number with an implementation of their algorithm. Did they use some kind of trick?
- fsh 4y agoThe actual work is done by a classical computer. Factoring a 48-bit number is not exactly difficult.
- chowells 4y agoWhy would they need to have done so? The blog post argues there's no evidence this is any faster than classical Schnorr's algorithm, and classical Schnorr's algorithm can easily factor a 48-bit number. And as the post also makes very sure to point out, Schnorr != Shor.
- Bootvis 4y agoShnorr != Schnorr