QC could help with the factoring of large integers A QC with sufficient perfect qubits could collapse modern [[Asymmetric Cryptography (PKC)]] based on [[Factoring Large Prime Numbers (RSA)]] or the [[Discrete Logarithm Problem]] ----- Worked out an efficient way of performing a Fourier Transform using a QC and applied it to formulate an efficient quantum algorithm for factoring large numbers.