|
|
|
|
|
|
by 0xb100db1ade
2543 days ago
|
|
|
> 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. |
|
|
> 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...