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.
GNU General Public License v3.0
56
stars
13
forks
source link
#12 - Replace for loop in ModularMultiplicativeInverse with extended euclidean gcd. #13
As per suggestion from @an31146 , issue #12