Could Shor's algorithm be applied to crack ECDSA?  I'm not sure.

Shor's algo is about factoring large prime integers.  In ECDSA there is an additional difficulty, as the algebra is not about integers but points of an elliptc curve.  Has anyone shown that solving the former permits solving the latter?