Multiple Polynomial Quadratic Sieve Integer Factoring Algorithm

This application implements the multiple polynomial quadratic sieve as made famous Peter Montgomery. It is the second best publicly known integer factoring algorithm second only to the special and general number field sieve. Uses a number of randomly chosen polynomials.

C# (152.0 KB)
260 times
Add to favorites
E-mail Twitter Digg Facebook
Click an item in the panel on the left to view the contents here.