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.

Implementation of Variational Quantum Factoring algorithm.

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.

Research project about factoring integers via lattice algorithms.

Integer Factorization Approaches with JavaScript

Module and command-line utility for factoring integers.

C++ Library for serialization/deserialization, Kairos provide also a benchmark system for C++ applications.

Factoring integers and polynomials

Sage scripts for completely factoring any integer efficiently with very high probability after a single run of an order-finding algorithm.

My honors thesis which was in the math department gave a survey modern day factoring and primality algorithms and the mathematics that went into them. This has clear connections to cryptography but is interesting in its own right. In particular, I thought that the quadratic sieve and number field sieve are particularly interesting because of all…

Variational Quantum Factoring

Some interesting numbers to lookup in factordb

A repository about Shor's algorithm

素数判定法と素因数分解アルゴリズムに関する教科書(pythonコード付き)

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.

quantum algorithm for factoring integers

The Quppy library for Python3 for simulating and post-processing Shor's order-finding and factoring algorithms.

Assessing factoring algorithms.

Self made RSA and number factoring algorithm with O(N)

Python implementation of Pollard's p-1, Pho and Wiener Attack. At least.