Description and implementation of the Shor's algorithm (to solve the prime factorization problem) using the IBM SDK Qiskit and the framework ProjectQ.

Quantum cracking encryption. Shor Algorithm.

A simple hand detection code for lazy people like me so you can use hand gesture to open apps from your taskbar!

Shor's factoring algorithm written in Rust

This is a python implemented factoring algorithm, that can be executed in polynomial time on a quantum computer such that it has sufficient Qbits and accuracy.

A toy RSA breaker based on Shor's algorithm ft. IBM QISKIT

The title of the thesis is Shor's algorithm in Quantum Cryptography. This repository contains the data and Jupyter notebooks containing the codes used in the Quantum simulations of different variants of Shor's quantum factoring algorithm. While IBM Qiskit has already implemented the algorithm using the standard Quantum Fourier Transform (QFT), t…

Shor's Algorithm implemented factorizing 63 on Qiskit using SWAP gates, Python 3.X

A repository about Shor's algorithm

Shor's algorithm is a Quantum Algorithm for Integer Factorisation, Finding Prime Factors of Large Composite Numbers. It Offers an Exponential Speedup Over Classical Methods, Posing a Profound Threat to Modern Public-Key Cryptography like RSA Encryption, Which Relies on Factoring Difficulty

Back to Bletchley Park challenge source code (Pwn2Win 2018)

Implementation of Shor's quantum algorithm for integer factorization

Writing factoring algorithms for classical and quantum computers and benchmarking them

A faster implementation of Shor's algorithm in Qiskit.