News for hackers. Stuff that matters.
Re:Factoring may be easier than we think (2016) by 0xb100db1ade on Sunday June 30, 2019 @12:47PM (#20319063)
> current factoring algorithms would require enough energy to boil all oceans on the earth, that's a lot even compared to the US's energy supply.

Interesting. For what algorithm & key size?

I'd love to quote this. I've heard it before but I don't remember the source.

Re:Factoring may be easier than we think (2016) by est31 on Sunday June 30, 2019 @01:07PM (#20319182)
https://eprint.iacr.org/2013/635.pdf

> Boiling all water on the planet (including all starfish) amounts to about 2^24 lakes of Geneva and leads to global security: 114-bit symmetric cryptosystems, 228-bit cryptographic hashes, 2380-bit RSA. This needs to be done 16 thousand times to break AES-128, SHA-256, or 3064-bit RSA.

I think this paper isn't using Landauer's bounds though, but conventional computers. So maybe my claim was wrong, because we aren't 16 thousand times away from Landauer's bounds but millions [1].

[1]: https://web.archive.org/web/20141219043239/http://www.bloomf...

Re:Factoring may be easier than we think (2016) by johndough on Sunday June 30, 2019 @07:58PM (#20321379)
But why the starfish.
Re:Factoring may be easier than we think (2016) by alfiedotwtf on Monday July 01, 2019 @12:00AM (#20322373)
Because if you're already boiling the oceans, you probably won't have enough left over in the budget for marine conservation.