A high-fidelity simulation of the General Number Field Sieve for factoring large integers by finding
non-trivial congruences.
1
Polynomial Selection
2
Sieving Smooth Relations
Objective: Find integer pairs $(a, b)$ where both $(a - mb)$ and the algebraic norm of $(a +
b\alpha)$ can be fully factored using our small prime numbers (Factor Base).
3
Exponent Matrix & GF(2) Systems
Searching for linear dependencies in the exponent matrix modulo 2.