3

Fuck. I don't think any conventional encryption stands a chance against this monster...
https://nextbigfuture.com/2019/09/...

Comments
  • 2
    Well, I guess it's time to pass to McEliece.
  • 2
    Fortunately with SHA for example encryption is O(n) while breaking is O(2^n) so if the computers get faster we just double the batch size (SHA512, etc.)
  • 0
    Time to roll my own
Add Comment