3 Remove extra signatures in cl_FF_from_float.cc and cl_DF_from_double.cc.
8 Niels Moeller's subquadratic GCD
10 - polynomial division and gcd
11 - polynomial documentation
12 7. add combinatorial, linear algebra, factorization, polynomial functions
14 7. finite fields, e.g.
15 - gf256_log_2, gf256_antilog_2, gf256_power_of_2, gf256_add, gf256_minus,
16 gf256_subtract, gf256_mul, gf256_inv, gf256_div, gf256_product, gf256_exp,
17 gf256_term, gfmul, gfadd, gfinv, gfexp.
18 more polynomial operations:
19 x(), power, >>, <<, division, scalmult, content, primitivepart,
20 gcd, xgcd, no_of_real_roots, factorization.
21 modular polynomials: powmod etc.
22 7. chinese remainder algorithm, maybe Hensel-lifting as in Magnum.
23 8. factor and primality testing for small integers
24 8. primality test in Z:
25 + polynomials cl_MUP_MI, cl_MUP_I
26 use integer FFT for multiplication in cl_UP_MI and cl_MUP_MI
28 + - complex values of j()
29 - Hilbert polynomial for j() 7.6.1
30 + roots of polynomials mod N 1.6.1
31 + - elliptic curves, Jacobi representation
32 - m.P on elliptic curve
37 - multiple polynomial quadratic sieve
39 Document the timing class