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.

A Java math library focused on number theory and integer factorization in particular.

R Package for Factoring Big Integers using the C Library GMP (GNU Multiple Precision Arithmetic)

High-performance integer factorization suite implementing GNFS, MPQS, and QS algorithms with optimized lattice reduction, vectorization, GPU acceleration, and tensor-based linear algebra. Features automatic algorithm selection, NUMA-aware scheduling, and checkpoint/restore for computational number theory research and cryptanalytic analysis.

A collection of Integer factorization algorithms

A collection of notes on mathematical Cryptography, ranging from classical methods through contemporary.

EPR: A Factoring and Primality checking library for C++

Very large integer factorization implemented in Python

Taxicab numbers, upper bounds up to BTa(23), their decomposition x³ + y³ (and prime factor decomposition)

Implementation of batch smoothness checking and factorization for Coppersmith's factorization factory.

Fast and efficient Fermat factorization CLI

A Practical Study and Comparison of Integer Factorization Methods

This project implements the Rabin Cryptosystem in SageMath, a public-key encryption algorithm based on the integer factorization problem. The system uses blum primes for p and q to simplify the decryption process.

格子を用いた素因数分解法

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

A simple Python script used to sets of three integer factors that are different and have a common product. Created for a grade 8 mathematics problem.

Prime decomposition of Kaprekar numbers (up to 29 digits)

A project that finds the two prime factors of a public key.

A Python implementation of the General number field sieve algorithm for factoring large integers

C++ port of DiffIntFactorTriplet. Much faster.