Jump to content

Fast Library for Number Theory

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Bluedecrypter (talk | contribs) at 23:09, 23 March 2008 (change sentence about what functionality implemented remove a subsection and rename subsection from integer factorization to quadratic sieve and add general reference to a video of a talk by Bill Hart). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
"FLINT" redirects here. For other uses, see Flint (disambiguation).
FLINT
Developer(s)William Hart and David Harvey
Stable release
1.0.9 / March 11, 2008
Repository
Written inC
Operating systemPOSIX systems
TypeMathematical software
LicenseGNU General Public License
Websiteflintlib.org

The Fast Library for Number Theory (FLINT) is a highly optimized C library for number theory applications. The two major areas of functionality currently implemented in FLINT are polynomial arithmetic over the integers and 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 Warwick and David Harvey of Harvard University to address the speed limitations of the Pari and NTL libraries.[1]

Motivation

Design Philosophy

Reliance on GMP

Functionality

Polynomial Arithmetic

Quadratic Sieve

Impact

Future Development

References

  1. ^ Page 10 of the Project Description for UW 2006 COMPMATH Proposal by William Stein
Retrieved from "https://en.wikipedia.org/w/index.php?title=Fast_Library_for_Number_Theory&oldid=200401338"