Why 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.
Shnorr != Schnorr
Also Schnorr != Shor != Schneier, which was a confusion in the HN thread about Bruce Schneier’s response to this paper
Eh. Spelling is hard, especially when you don't know the country of origin for proper names. What're you gonna do?
Snore?
The actual work is done by a classical computer. Factoring a 48-bit number is not exactly difficult.