Implementation of Variational Quantum Factoring algorithm.
-
Updated
Jun 17, 2023 - Python
Implementation of Variational Quantum Factoring algorithm.
A complete, proof-of-concept, C# implementation of the General Number Field Sieve algorithm for factoring very large semi-prime numbers. The focus was on readability and understandability of the code, not performance.
The Sage implementation of a simulator for Regev's factoring algorithm, and of Ekerå–Gärtner's extensions to discrete logarithm finding, order finding and factoring via order finding.
Mersenne prime search using integer arithmetic and an IDBWT via an NTT executed on the GPU through OpenCL.
素数判定法と素因数分解アルゴリズムに関する教科書(pythonコード付き)
Variational Quantum Factoring
Python implementation of Pollard's p-1, Pho and Wiener Attack. At least.
Integer factoring ft. genetic algorithm
The Quaspy library for Python for simulating and post-processing various quantum algorithms, including Shor's algorithms and Ekerå–Håstad's variations of Shor's algorithms.
Self made RSA and number factoring algorithm with O(N)
Integer Factorization Approaches with JavaScript
A repository about Shor's algorithm
The Quppy library for Python3 for simulating and post-processing Shor's order-finding and factoring algorithms.
quantum algorithm for factoring integers
A C implementation of the Quadratic sieve for factoring large integers.
Factoring integers and polynomials
C++ Library for serialization/deserialization, Kairos provide also a benchmark system for C++ applications.
Research project about factoring integers via lattice algorithms.
Some interesting numbers to lookup in factordb
Add a description, image, and links to the factoring-integers topic page so that developers can more easily learn about it.
To associate your repository with the factoring-integers topic, visit your repo's landing page and select "manage topics."