Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Smart innovation, systems and technologies

Breaking Integer Factorization Using Shor’s Algorithm: A Practical Approach with IBM Qiskit

Anand Ghugare, Atharva Rajoba, Dinesh Kumar Saini

Published Jan 1, 2026• 0 citations
Publisher
DOI
10.1007/978-3-032-12983-3_3

Related papers

Quantum Threat to Cryptographic Security: Implementation and Analysis of Shor’s Algorithm for Integer Factorization Using IBM Qiskit

Anubhav Saxena, Dinesh Kumar Saini, Satpal Singh Kushwaha

Lecture notes in networks and systems•Oct 29, 2025•1 citation

Shor’s Algorithm for Integer Factorization

Franklin de Lima Marquezino, Renato Portugal, Carlile Lavor

SpringerBriefs in computer science•Jan 1, 2019•16 citations

Enhanced Security Algorithm for Integer Factorization in Quantum Computing: Optimizing Shor’s Algorithm

Rashmi Kuksal, Sumit Chaudhary, Ashish Bhatt

International Conference on Innovative Mechanisms for Industry Applications•Oct 1, 2026•0 citations

Circuit implementation of Shor's algorithm for the factorization of small integers in Qiskit

Iheb Eddine Gharbi, Amor Gueddana, Hichem Eleuch +1 more

To factor an integer N into a product of two other numbers N1 and N2, Shor’s algorithm uses the Quantum Fourier Transform on n qubits, denoted QFTn, to determine the period r of a Modular Exponentiation Function (MEF), which is later used to compute a factor of N. In this work, we present Shor’s algorithm for factoring an integer of n qubits and illustrate an example with n=4. We implement our algorithm using Qiskit and IBM quantum computers, which also can be adapted on other quantum computing platforms with minor adjustments. We discuss the IBM quantum computer limitations for running our circuit and show the impact of device imperfections on the factored result.

Quantum Communications and Quantum Imaging•Aug 13, 2024•2 citations

Quantum Decryption using Shor’s Algorithm

Shreshtha Mishra, Ojusav Agarwal, Sunil Kumar Patel

This paper presents the generalized implementation of the quantum circuit utilized in Shor’s algorithm, which was simulated using the quantum simulator offered by IBM. Shor’s Algorithm is a ground-breaking Quantum Algorithm that works on Integer Factorization; for a classical computer, the following task would require an exponential amount of time, whereas a Quantum Computer running Shor’s Algorithm would only require Polynomial-time. Using the principles of Quantum Superposition and Quantum Entanglement, the algorithm demonstrates the potential of quantum computing to solve complex mathematical problems efficiently. Experimental results show the effectiveness of the implemented algorithm in Integer Factorization and discrete logarithm, disturbing the safety of major encryption algorithms. This paper contributes to advancing the understanding and practical application of quantum algorithms in real-world scenarios.

IEEE Pune Section International Conference (PuneCon)•Dec 13, 2024•9 citations

Quantum Factorization: Shor's Algorithm

Rafael Pereira da Silva

•Jan 1, 2024•0 citations
To factor an integer N into a product of two other numbers N1 and N2, Shor’s algorithm uses the Quantum Fourier Transform on n qubits, denoted QFTn, to determine the period r of a Modular Exponentiation Function (MEF), which is later used to compute a factor of N. In this work, we present Shor’s algorithm for factoring an integer of n qubits and illustrate an example with n=4. We implement our algorithm using Qiskit and IBM quantum computers, which also can be adapted on other quantum computing platforms with minor adjustments. We discuss the IBM quantum computer limitations for running our circuit and show the impact of device imperfections on the factored result.
This paper presents the generalized implementation of the quantum circuit utilized in Shor’s algorithm, which was simulated using the quantum simulator offered by IBM. Shor’s Algorithm is a ground-breaking Quantum Algorithm that works on Integer Factorization; for a classical computer, the following task would require an exponential amount of time, whereas a Quantum Computer running Shor’s Algorithm would only require Polynomial-time. Using the principles of Quantum Superposition and Quantum Entanglement, the algorithm demonstrates the potential of quantum computing to solve complex mathematical problems efficiently. Experimental results show the effectiveness of the implemented algorithm in Integer Factorization and discrete logarithm, disturbing the safety of major encryption algorithms. This paper contributes to advancing the understanding and practical application of quantum algorithms in real-world scenarios.