I obviously can’t understand shit this paper is talking about. But it seems like they have a way to quickly and easily factor prime numbers, which if true, I believe would substantiate the claim they make of destroying the RSA cryptosystem. That “if true” is at the bottom of the dead sea as far as I’m concerned. Let’s wait and see what people who understand math say, and if anyone can produce an actual functioning program.
It’s at least mildly interesting that someone would have the guts to publish and make the claim.
I have been seeing this paper by cryptographer Peter Schnorr making the rounds: “Fast Factoring Integers by SVP Algorithms.” It describes a new factoring method, and its abstract ends with the provocative sentence: “This destroys the RSA cryptosystem.”
It does not. At best, it’s an improvement in factoring — and I’m not sure it’s even that. The paper is a preprint: it hasn’t been peer reviewed. Be careful taking its claims at face value.