You are reading content from Scuttlebutt
@cryptix %csmM92mPJG2E2aoekh3XG59OnwiNgUmYLNv2vFDbarE=.sha256

A wild Schnorr (paper) appears and seems to break RSA.

eprint IACR Paper PDF

Some discussion pointers:

https://twitter.com/ManishEarth/status/1366906561486983171
https://twitter.com/FredericJacobs/status/1367115794363088897
https://twitter.com/matthew_d_green/status/1366950093178499073

@cryptix %h3Nk+DIlG/TZv/hAS73yOaUacdKuzSLSKcMiyu/TW+Q=.sha256

Initially I heard theories that somebody used his name but people closer to him seem to confirm that he says "yup that's from me".

Now we just have to wait for people to grok this... 😅

@andrestaltz %kHxjKFh82+YUqFbTQhamKU1RCmdA4FcAhv1kqULwnl0=.sha256

I had a cryptanalysis course in the university where we cracked RSA in special cases where the primes were chosen in bad way. If I had the patience to brush off the skills, I could try to read this, but I don't have the patience. The language looks on spot, lattices etc. What we need is for someone to translate this into "here are the circumstances where cracking RSA is fast with this method". There are already fast methods to crack RSA, but they only apply in some circumstances, which everyone (should) avoids when setting up RSA. Hopefully it's not a "fast in all circumstances" method.

@cryptix %o7gZ0i92DMRI6zd/b7csFQavvGkR/F4yGfNTvF/Tjoo=.sha256

Yup, agreed. And as Matthew points out there is lots of drama to be had by claiming to have a sufficiently fast factoring algorithm that no-one understands.

I grokked number field sieves to a point but will sit this one out for other people to wade through.

User has not chosen to be hosted publicly
Join Scuttlebutt now