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.
Perl number theory module using XS/GMP
R Package for Factoring Big Integers using the C Library GMP (GNU Multiple Precision Arithmetic)
EPR: A Factoring and Primality checking library for C++
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 notes on mathematical Cryptography, ranging from classical methods through contemporary.
A collection of Integer factorization algorithms
Multi-backend ECM stage-1 & satge-2 engine (OpenCL · CUDA/CGBN · AVX-512 IFMA) with GMP-ECM & Prime95 savefile interop and a worktodo queue manager.
Алгоритм факторизации чисел методом квадратичного решета
Taxicab numbers, upper bounds up to BTa(23), their decomposition x³ + y³ (and prime factor decomposition)
Berry ecosystems opensource optimation quantize student model precise+very fast with LUT lookups
CADO-NFS (modern): an enhanced modernization + performance fork of CADO-NFS (Number Field Sieve — integer factorization & discrete log) on current toolchains. Adds GPU linear algebra + full vector residency, a GPU ECM pre-factoring front-end, SDE-validated AVX-512 VPCLMULQDQ/IFMA kernels, and Rust orchestration. LGPL-2.1.
A Python implementation of the General number field sieve algorithm for factoring large integers
Implementation of batch smoothness checking and factorization for Coppersmith's factorization factory.
Very large integer factorization implemented in Python
A classical teaching tool for exploring the number theory at the heart of Shor’s algorithm through interactive period finding, FFT visualizations, factor extraction, and honest experimental benchmarks.
Fast integer factorization in Rust with Lenstra's elliptic curve method (ECM), P-1 and P+1.
Fast portable C/GMP integer factorization using SIQS (Self-Initializing Quadratic Sieve), including pthreads parallelism.
A Practical Study and Comparison of Integer Factorization Methods
To associate your repository with the integer-factorization topic, visit your repo's landing page and select "manage topics."