Error in the article: 32x32bit multiply (i.e. 2^64 bits) is not a "heat death of the universe" thing.
It's a lot, yes. Not practical for these purposes. But there's a reason we don't use 64bit encryption.
64bit encryption is easily brute forced.
If you want to keep it in a table, sure that's 18 exabytes (multiplied by element size in bytes), but that's before compression. I imagine multiply output compresses very well. And that's a lot of RAM. But not anywhere near "heat death of the universe" amounts.
I bet FAANG easily have that much RAM. Each of them.
It's a lot, yes. Not practical for these purposes. But there's a reason we don't use 64bit encryption.
64bit encryption is easily brute forced.
If you want to keep it in a table, sure that's 18 exabytes (multiplied by element size in bytes), but that's before compression. I imagine multiply output compresses very well. And that's a lot of RAM. But not anywhere near "heat death of the universe" amounts.
I bet FAANG easily have that much RAM. Each of them.