Hacker News new | ask | show | jobs
by greenavocado 404 days ago
Is there a more efficient way? What's the state of the art?
3 comments

Only slightly more efficient, 2²⁵⁴·³: https://en.wikipedia.org/wiki/Advanced_Encryption_Standard#K...
IDK, let's ask a mathematician. Oh, they all work for NSA.
I like to tell myself that everyone at NSA is a fine upstanding patriot, and that the agency only ever does what is in the best interest of the American People, but that does feel naive at times. Like when they infiltrate international standards bodies to introduce backdoors.

Is downsizing the NSA something we're upset about?

It doesn't even really matter what character most of them have. Most information is on need to know basis for a reason so the one giving the orders can tell a tale about foreign terrorists while the grunts happily surveil the common man.
Or when they walk out the door with gigabytes of secret data in their pocket.
If you can find a quantum computing solution it's at worst O(sqrt(n)).

There still seems to be a time factor, if not energy factor to computation.

Shor's algorithm for factoring prime numbers is at best O(log(n)^2 * log(log(n)))