flintqs

Program using quadratic sieve to factor integers

Description

This package includes William Hart's program to find prime factors of large integers (at least forty digits).

It does so using highly optimized multi-polynomial quadratic sieve.

Upload more screenshots

Please help extend the collection of screenshots. Just make a screenshot and upload it here. You don't need to register or anything.

Upload a screenshot

Hint: upload an image here from your clipboard with Ctrl-V


Homepage

https://github.com/sagemath/FlintQS


Install this software package

If the package is available for the distribution you are currently using on your computer then install the software by clicking on…

Install flintqs

Cookies help us deliver our services. By using our services, you agree to our use of cookies. Learn more