> 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

> 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.