Schnorr comes again. Will he really break RSA this time? But he still didn't give any concrete examples that can enable us to quickly verify his claim.
$\begingroup$
$\endgroup$
4
-
2$\begingroup$ He fixed the 'destroyes' --> 'destroys' which took away the charm from it. $\endgroup$– mostlycrypticJul 12, 2021 at 5:01
-
$\begingroup$ Earlier question on the earlier article. $\endgroup$– fgrieu ♦Jul 12, 2021 at 6:23
-
5$\begingroup$ I stand by my answer to the previous question (I'm not sure there is a point in re-posting that as an answer): if the claim was true, then there would be an extremely simple way to prove it: 10^10 arithmetic operations is nothing. There are tons of 800-bit factoring challenges available online. The author could just solve them and include the factorization in the submission; the lack of such a straightforward validation should be taken as empirical evidence that the claim is, as of today, unsubstantiated at best. $\endgroup$– Geoffroy CouteauJul 12, 2021 at 13:43
-
1$\begingroup$ Kind of agree, but the fact that the author thinks that there is a more efficient way to refactor doesn't mean that it is necessarily easy to implement the attack. That said, so far all attempts have failed it seems. $\endgroup$– Maarten Bodewes ♦Jul 23, 2021 at 12:41
Add a comment
|