flintqs

Program using quadratic sieve to factor integers

Command lineScience

Not tested on a device yet. What that means

Commands in the package

QuadraticSieve

About flintqs

From Debian's package 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.

From Debian's description of the flintqs package, under that package's license.

Dependencies

Depends on

libc6
libgmp10
libstdc++6

Related apps

lp-solveSolve (mixed integer) linear programming problemsCommand line
gdal-binGeospatial Data Abstraction Library - Utility programsCommand line
coinor-cbcCoin-or branch-and-cut mixed integer programming solverCommand line
coinor-symphonyCOIN-OR solver for mixed-integer linear programsCommand line
gmp-ecmFactor integers using the Elliptic Curve MethodCommand line
pyecminteger factorization with the Elliptic Curve Method (ECM)Command line

All Linux science apps

Sources and licenses

Name: the Debian package name.
Summary: Debian's short description of the flintqs package, under that package's license.
Description: Debian's description of the flintqs package, under that package's license.
Versions and sizes: Debian's archive for ARM64, as on packages.debian.org.
Popularity: Debian Popularity Contest counts.