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

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.

Write ups on Mathematical Cryptography

A C implementation of the Quadratic sieve for factoring large integers.

Implementation of some basic algorithms relevant for cryptography.

A Python implementation of the Quadratic sieve algorithm for factoring large integers

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.

A module for basic math in the general vicinity of computational number theory.

Quadratic Sieve integer factorization method for JavaScript bigints

COL759 Assignment-2

A collection of Integer factorization algorithms

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

naive quadratic sieve implementation https://www.ams.org/notices/199612/pomerance.pdf

An efficient implementation of Quadratic Sieve in Java

This quadratic sieve implementation is a part of the coursework for MATH 404 Mathematical Cryptography with Prof. Samit Dasgupta at Duke University.

A Practical Study and Comparison of Integer Factorization Methods