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