Skip to content

elia1359/Shor_Algorithm-Quantum-Computing-

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

8 Commits
 
 
 
 

Repository files navigation

🧠 Quantum Computing Division – RSA Factoring Demonstration

Subject: Implementation of Shor’s Algorithm for Integer Factorization
Platform: Qiskit (IBM Quantum)
Objective: Demonstrate quantum-assisted factorization of RSA semiprime n = 143


This repository presents a verified simulation of Shor’s Algorithm, executed via Qiskit’s quantum simulator backend (aer_simulator).
The goal is to break RSA encryption by factoring a small semiprime integer using quantum logic gates, including Hadamard and CNOT operations.

The implementation demonstrates how quantum computers can efficiently solve the integer factorization problem, which forms the basis of classical cryptographic protocols such as RSA.

All code is modular, commented, and designed for reproducibility.
This simulation lays the groundwork for future advancements in post-quantum cryptanalysis.


⚠️ Note: This project is intended for academic and educational purposes only.
Factoring larger semiprimes (e.g., 2048-bit RSA keys) remains beyond current quantum hardware capabilities.

About

Implementation of Shor's Algorithm to factor semiprime numbers using Qiskit and Quantum Circuits.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages