Commit Graph

11 Commits

Author SHA1 Message Date
naddy
2276d3b230 remove WWW lines 2003-12-15 21:42:08 +00:00
naddy
b920329f14 Update to 5.3.1; from Tom Knienieder <tom@knienieder.com>.
Fixes a bug affecting the BuildIrred routines for ZZ_pEX and zz_pEX.
2002-12-19 19:10:56 +00:00
naddy
dfe31ad4af Update to 5.3; from maintainer Tom Knienieder <tom@knienieder.com>.
Changes in this release:

Minimized and isolated constructs that do not adhere to C/C++
standards, and added flags NTL_CLEAN_INT and NTL_CLEAN_PTR
which force stricter compliance with these standards

Added functions IsWhiteSpace, CharToIntVal,
and IntValToChar to the tools module

Added methods allocated, position1 to generic vector classes

Added method allocated to the class vec_GF2

Added conversion routines from unsigned int/long to int, long, float,
and double

Added routines AddPrec, SubPrec, etc., to the RR
module, and declared the practice of directly  assigning to the variable
RR::prec obsolete

Fixed a number of minor bugs.
2002-07-17 23:33:20 +00:00
naddy
f2fea99a0b Update to 5.2.
Submitted by maintainer Tom Knienieder <tom@knienieder.com>;
some massaging by yours truly.
2002-01-28 23:02:50 +00:00
reinhard
d82badf0f3 update to ntl-5.1a; from Maintainer 2001-06-15 08:59:48 +00:00
lebel
b9dee42d51 math: integrate COMMENT, bump NEED_VERSION. 2001-05-06 01:58:40 +00:00
wilfried
d407c41896 respect CC/CXX/CFLAGS, ok maintainer 2001-03-16 13:45:44 +00:00
reinhard
b94bb4f261 o) use do-install (to get perms right) instead of patch
o) bump NEED_VERSION
2001-02-16 08:56:16 +00:00
espie
88ad03f3e7 cvs always strikes twice. 2001-02-09 14:41:36 +00:00
espie
904377bd1a remove useless pre-patch, use MAKE_FILE. 2001-02-09 14:41:18 +00:00
reinhard
090c1d231e NTL is an object oriented library for number theory, written
by Victor Shoup.  It provides objects and methods for
        - arbitrary length integers
        - finite fields
        - polynomials over fields
        - extensions of fields.
 
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.

MAINTAINER=     Tom Knienieder <tom@knienieder.com>
2001-01-08 16:15:35 +00:00