accessibility ffpoly

The ffpoly library provides a callable interface to a low level C implementation of arithmetic over finite fields Fq of low degree (d ≤ 3) and medium characterstic (p < 261), and over the polynomial ring Fq[x]. To more efficiently handle polynomials of large degree, the library can be compiled to use a fork of David Harvey's zn_poly library described in the paper:

 David Harvey, Faster polynomial multiplication via multipoint Kronecker substitution, Journal of Symbolic Computation 44 (2009), 1502-1510.

Dependencies: gmp

Download link: ff_poly_v1.3.0.tar (2MB), ff_poly_v1.3.0.tar (2.1MB, includes zn_poly)