AdamWhiteHat/GNFS

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.

C#GPL-3.0

Issues

Inefficient square root
#16 opened a year ago by GregoryMorse
5
BUG: Misc Bugs & PR request offer
#15 opened a year ago by alexhiggins732
7
Replace for loop in ModularMultiplicativeInverse
#12 opened 2 years ago by an31146
2
Question: I need just function Factorization(n) for get prime numbers. Is it possible?
#11 opened 2 years ago by potaninmt
1
Sorry for all the problems but now after i run the factor bases and roots, and go to find relations the program crashes
#10 opened 5 years ago by stewcop
2
how to make this program work
#9 opened 5 years ago by stewcop
2
it may be dumb but i dont know how to run
#8 opened 5 years ago by stewcop
1
What mean Smoothness Bound
#7 opened 5 years ago by SlimRG
2
Biggest factor
#5 opened 5 years ago by Manuel3115
4
Request for example
#1 opened 5 years ago by SethKitchen
2