Hacker News new | ask | show | jobs
by uv-depression 817 days ago
Symmetric algorithms are largely safe-ish; the best known attack is Grover's algorithm, which reduces the effective bits by half (runs in O(sqrt(N)) evaluations). Shor's algorithm is a polynomial-time solution to the discrete logarithm problem, which has traditionally been the basis for asymmetric cryptography.
1 comments

> Shor's algorithm is a polynomial-time solution to the discrete logarithm problem

Yes, exactly, and the discrete logarithm problem is but a narrow sliver of a much larger class of trapdoor functions, most of which don't have the equivalent of Shor's algorithm to be attacked with.

That's precisely the point I was trying to make.