cococonspirator
cococonspirator on Hacker News
Re:Factoring may be easier than we think (2016)
on Sunday June 30, 2019 @11:50AM (#20318810)
You won’t necessarily be able to verify it works empirically, even if you can prove so analytically, because it would be a complexity bound that was broken. If I could crack RSA keys for a mere one million times the computational resources used to create them, that would be a groundbreaking result and I would have “broken RSA”, but _I_ still wouldn’t be able to crack any RSA keys at all.