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.

python cryptography cryptanalysis algorithms optimization rsa computational-mathematics high-performance-computing gpu-acceleration vectorization number-theory integer-factorization lattice-reduction tensor-networks algebraic-number-theory quadratic-sieve mpqs montgomery-arithmetic bkz gnfs

• Updated Mar 25, 2026
• Python

The General Number Field Sieve (GNFS) is the Most Efficient Classical Algorithm Known for Factoring Extremely Large Composite Integers, Typically Those Over 100 Decimal Digits (Like Those Used in RSA Cryptography)

parsonlabs gnfs general-number-field-save

• Updated Nov 24, 2025
• Rust

A General Number Field Sieve (GNFS) implementation written from the ground up in C++, C, and x86_64 NASM.

cpp17 nasm-assembly karatsuba-multiplication miller-rabin tonelli-shanks jacobi-symbol gnfs general-number-field-save quadratic-characters

• Updated May 1, 2026
• C++

Adaptive-cascade integer factorization in Rust (GNFS/SIQS/ECM) with CLI and Python bindings

rust cli cryptography python-bindings prime-numbers factorization number-theory gnfs

• Updated Nov 10, 2026
• Rust