Earlier quoted context omitted.
he spells it like that on his published research, though. See here: https://link.springer.com/chapter/10.1007/978-3-642-42001-6_...
yep, found that too. disregard that then, just seemed odd on first glance.
Agree!
“This destroys the RSA cryptosystem”
51–60 of 152 posts
Re: “This destroys the RSA cryptosystem”
#52Re: “This destroys the RSA cryptosystem”
#53GPT-3?
Re: “This destroys the RSA cryptosystem”
#54The author of this paper is Claus P. Schnorr[1], of Schnorr signature fame. The paper has almost the same title as a 2017 draft paper[2] of his. The “This destroyes the RSA cryptosystem” quote is not in the linked paper abstract. This seems fishy. [1] https://en.wikipedia.org/wiki/Claus_P._Schnorr [2] https://www.math.uni-frankfurt.de/~dmst/research/papers/SVP9...
> The paper has the same title as a 2017 draft paper
Not quite the same title. He has papers with similar titles since at least 2010.
I wanted to say thanks - this document linked to on his wikipedia page was unexpectedly fascinating! NSA, patents, conspiracies..
Re: “This destroys the RSA cryptosystem”
#55It looks like someone read the paper and came to the conclusion that this shortens the expected lifespan of RSA and submitted the paper to IACR. I doubt it was Schnorr himself who decided to make the sensationalist claim.
The final theorem in the paper is where the polynomial time claim is states. Can't quote it here because it would make no sense in isolation, but the math is readable and the claims should be independently verifiable.
Re: “This destroys the RSA cryptosystem”
#56They only tested with numbers size of ~2^800, which is around 240 digits, but I believe (correct me if I'm wrong) there exists usages of RSA with over 600 digits, so it'll still take a massively long amount of time to factor those numbers...
It's worth noting that numbers of this size are already being factored with existing techniques. RSA-250, a 250 digit (829 binary digit) product of two primes was factored pretty recently: https://lists.gforge.inria.fr/pipermail/cado-nfs-discuss/202...
Moreover, a 768 bit product was factored over 11 years ago, though it took two years to compute! https://en.wikipedia.org/wiki/RSA_Factoring_Challenge
Re: “This destroys the RSA cryptosystem”
#57Earlier quoted context omitted.
"This proves the polynomial time bound."
If true... Hot damn! There's NP-Hard problems that if we had polynomial time solutions for we could vastly improve the quality of life on earth.
Integer factorizatiom not proved to be NP-complete. It's been guessed to be "hard" for a while.
Re: “This destroys the RSA cryptosystem”
#58Is it just me or is that really hard to read?
Re: “This destroys the RSA cryptosystem”
#59Earlier quoted context omitted.
If that's the case it's funny to think... NSA could have sat on this for years. Though that would be a really hard secret to keep.
I've held the theory that if anybody found something like fast prime factoring or a P = NP proof, they'd get assassinated pretty quickly. It'd be in basically every government's interest to get the knowledge, then make sure nobody else has it.
Somebody has been watching a lot of television.
Re: “This destroys the RSA cryptosystem”
#60The author of this paper is Claus P. Schnorr[1], of Schnorr signature fame. The paper has almost the same title as a 2017 draft paper[2] of his. The “This destroyes the RSA cryptosystem” quote is not in the linked paper abstract. This seems fishy. [1] https://en.wikipedia.org/wiki/Claus_P._Schnorr [2] https://www.math.uni-frankfurt.de/~dmst/research/papers/SVP9...
It is strange, perhaps a pdf reader exploit?