Nation-state adversaries may have faster ASICs and better theorems than we have, but they cannot escape the incompleteness theorem.
-
-
-
What if you encrypt encrypted data? One pass with AES256 and another with 3DES? The decryption effort would be exponential per layer.
- 3 more replies
New conversation -
-
-
I would more willingly wager on the unbreakability of number theory than on Turing average-case complete crypto that does not yet exist.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
It would be nice to see intelligent people take back the financial world. Getting tired of $20,000,000,000,000 and growing, national debt.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Eh, most hacks are based on implementation flaws anyways. Turing completeness based cryptography might not even be possible.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.