A Practical Study and Comparison of Integer Factorization Methods

Genetic algorithm for integer factorization w/ CUDA support.

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.

Very large integer factorization implemented in Python

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

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

C++ port of DiffIntFactorTriplet. Much faster.

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

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

A collection of Integer factorization algorithms

emojinを用いて試し割法を行うemojin

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.

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

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

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.

Fast and efficient Fermat factorization CLI

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.

Quadratic Sieve implementation for large integer factorization using GMP for arbitrary precision arithmetic and MPI for parallel distributed sieving. Includes smooth relation collection, Gaussian elimination over GF(2), and non-trivial factor extraction on 40–50 digit numbers.

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