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.

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)