Polynomial-time quantum factoring: reduce factoring N to period-finding f(x) = a^x mod N using quantum Fourier transform. Breaks RSA — classically sub-exponential, quantumly O((log N)³).