Schnorr confirms paper is his, claims it “destroys RSA cryptosystem”
In the 2020 preprint:<p>&quot;These new algorithms factor integers N ≈ 2^400 and N ≈ 2^800 using 7x10^10 and 4.3x10^12 arithmetic operations&quot;.<p>He does not specify how many it uses for 2^1024 or 2^2048. This is clearly nonlinear. Assume (nevertheless) that you multiply x100 every 400 binary digits, then for<p>2^2048, you get<p>(2048-800) equiv 1200&#x2F;400 equiv 3, so you would need approx. 10^12*10^6 operations. Assuming you can do 10^6 ops , you need 10^12 seconds (like 30000 years).<p>BUT those are very very rough assumptions (an &quot;arithmetic op&quot; might probably take more than 1 microsec).<p>EDIT: sorry, this link is pretty interesting. Factor RSA-260, which only has 862 bits. Should be feasible in about 2 hours. The link: <a href="https:&#x2F;&#x2F;crypto.stackexchange.com&#x2F;questions&#x2F;88582&#x2F;does-schnorrs-2021-factoring-method-show-that-the-rsa-cryptosystem-is-not-secur&#x2F;88590#88590" rel="nofollow">https:&#x2F;&#x2F;crypto.stackexchange.com&#x2F;questions&#x2F;88582&#x2F;does-schnor...</a><p>EDIT2: sorry again: Schnorr is 78 years old. I am not gerontophobic (being 50 I am approaching that age) but: Atiyah claimed the Riemann Hypothesis, Hironaka has claimed full resolution of singularities in any characteristic... And I am speaking of Fields medalists.<p>So: you do really need peer-review for strong arguments.