Quantum computers poses a significant threat to traditional cryptography systems, which depend on integer factorization. Theoretically, Shor’s algorithm, a quantum polynomial-time algorithm, allows quick factorization of huge semiprimes, compromising the RSA protocol. This paper shows hardware-based execution by implementing Shor’s algorithm using IBM’s quantum resource and Qiskit framework to factor the number 221. The study examines the success probability and performance limitations of implementation on noisy quantum hardware. Our results provide valuable insights into effective quantum cryptanalysis and pave the path for scaling such approaches for larger numbers.