GNFS | General Number Field Sieve algorithm | Math library

GNFS is a C# library typically used in Institutions, Learning, Education, Utilities, Math applications. GNFS has no bugs, it has no vulnerabilities, it has a Strong Copyleft License and it has low support. You can download it from GitHub.

C# .NET implementation of the general number field sieve for factoring very large semi-prime numbers, which are used by the RSA public key encryption algorithm. The general number field sieve is an involved process, consisting of many steps: a polynomial creation, testing and selection process, finding 'relations' who's algebraic and rational norms are smooth with respect to an algebraic and rational factor base, the creation, and solving of a (very) large (0,1)-matrix to find sets of relations where the product of all the norms in that set are a perfect square number, finding the square roots of polynomials over a finite field, the Chinese remainder theorem and finally the testing of several found candidates for a non-trivial difference of squares. Did you understood all that? Good. Because it's * just * that easy, folks!   /s.