Yes, Shor's algorithm would be a feat of quantum computing hardware. I was referring to if it was possible to break encryption using classical computers in pol

Yes, Shor's algorithm would be a feat of quantum computing hardware. I was referring to if it was possible to break encryption using classical computers in polynomial time -- that would be a feat of mathematics, if it were even possible, and would likely have implications about P vs. NP.