Fast Library for Number Theory
The Fast Library for Number Theory is a C library for number theory applications. It implements efficient versions of various ring arithmetics as well as derived functionality such as integer factorization using a quadratic sieve. The library is designed to be compiled with the GNU Multi-Precision Library and is released under the GNU [General Public License]. It is developed by William Hart of the University of Kaiserslautern and David Harvey of University of [New South Wales] to address the speed limitations of the PARI and NTL libraries.
FLINT along with a Cython wrapper for it is distributed with SageMath.
The development of FLINT has led to significant contributions in the areas of integer factorization and polynomial arithmetic. For example as of May, 2007 on certain platforms FLINT factors integers in the quadratic sieve range faster than any other general implementation, and as of February, 2008 it does arithmetic in faster than any other package.
Functionality
Core:- Ring arithmetic
- * Exact real numbers
- * Arbitrary-precision approximate real numbers with ball arithmetic
- Polynomials, power series, and matrices building on top of ring arithmetics.
- Primality testing
- Integer factorization
- Multivariate polynomial GCD and factorisation
- FFTs
- Multimodular reconstruction
- Special functions
- Exact and approximate linear algebra
- LLL
- Finite field embeddings
- ... and more.
Use in research