[qualeed]

I remember Peter Gutmann posting about this on the metzdowd cryptography mailing list in March. Fun to see this a few months later.

It starts here: https://www.metzdowd.com/pipermail/cryptography/2025-Februar...

This part is from farther down thread:

"Just as a thought experiment, what's the most gutless device that could perform this "factorisation"? There's an isqrt() implementation that uses three temporaries so you could possibly do the square root part on a ZX81, but with 1k of RAM I don't think you can do the verification of the guess unless you can maybe swap the values out to tape and load new code for the multiply part. A VIC20 with 4k RAM should be able to do it... is there a programmable calculator that does arbitrary-precision maths? A quick google just turns up a lot of apps that do it but not much on physical devices.

Peter."

[remcob]

You can verify in limited memory by repeatedly verifying modulo a few small integers. If that works, then by Chinese remainder theorem the main result also holds.