i'm trying implement threshold elgamal , need library supports both big numbers , polynomials. polynomials use ntl , big numbers choose openssl bignum. problem big numbers must coefficients of polynomials, in ntl either zz or zz_p.
the description of zz says: "big integers": signed, arbitrary length integers.
is enough?
zz can store integer want.
zz_p represents numbers modulo p (any intager, not prime), p of type zz, can (positive) integer want.
the classes polynomials zzx , zz_px. here limitation, degree of polynomials have of type long, think has upper bound of 2³¹-1, since degree signed long , 0 polynomial has degree -1 (by definition in ntl).
but notice, should compile ntl gmp best performance using big integers.
Comments
Post a Comment