[Previous] [Up] [Next]

A Tour of NTL: Introduction

NTL is a high-performance, portable C++ library providing data structures and algorithms for arbitrary length integers; for vectors, matrices, and polynomials over the integers and over finite fields; and for arbitrary precision floating point arithmetic.

NTL provides high quality implementations of state-of-the-art algorithms for:

NTL's polynomial arithmetic is one of the fastest available anywhere, and has been used to set "world records" for polynomial factorization and determining orders of elliptic curves.

NTL's lattice reduction code is also one of the best available anywhere, in terms of both speed and robustness, and one of the few implementations of block Korkin-Zolotarev reduction with the Schnorr-Horner pruning heuristic. It has been used to "crack" several cryptosystems.

NTL can be easily installed in a matter of minutes on just about any platform, including virtually any 32- or 64-bit machine running any flavor of Unix, Mac OS, or Windows. NTL can be built in conjunction with GMP (the GNU Multi-Precision library) for enhanced performance (this is the default on Unix and Mac OS). NTL can also be built in conjunction with the gf2x library for faster arithmetic of large degree polynomials over GF(2).

NTL provides a clean and consistent interface to a large variety of classes representing mathematical objects. It provides a good environment for easily and quickly implementing new number-theoretic algorithms, without sacrificing performance.

NTL is written and maintained by Victor Shoup with some contributions made by others (see Acknowledgements).

Lincensing: LGPLv2.1+

NTL is free software, and may be used according to the terms of the GNU Lesser General Public License version 2.1 or later.

[the precise licensing information of NTL]

[more information about GNU Licenses]

[Previous] [Up] [Next]