You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
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.
My honors thesis which was in the math department gave a survey modern day factoring and primality algorithms and the mathematics that went into them. This has clear connections to cryptography but is interesting in its own right. In particular, I thought that the quadratic sieve and number field sieve are particularly interesting because of all…