Re: "All cryptography is breakable" criticism

Yes using Shor's algorithm the search speed can be increased exponentially however at what cost?

What does Shor's algorithm have to do with hashing? And isn't the hashing so complex that decoherence will happen in the middle of the QC anyway?