Sun Jan 23 20:48:01 PST 2005

Fixed BB signatures bug: had inited a variable twice by accident, the
second time it was being placed in the wrong group.

Tue Jan 18 13:52:47 PST 2005

BB signatures coded. Just about to test them.

Sun Dec 26 02:58:54 PST 2004

Coded routines to serialize and deserialize element_t, though only for
the rings needed for the pairing, i.e. F_p and F_p^k.

Wrote testbls program, BLS signature library works, but at the moment
only the signature can be read from and written to disk.

Tue Dec 21 02:30:50 PST 2004

Working on BLS signature library.
Changed out_str functions to take base argument, like GMP.

Thu Dec  9 13:22:06 PST 2004

Got rid of pbc_init().
Wrote IBE demo, testibe.c and short signatures demo, testsig.c.

[0.0.1]

Wed Dec  8 15:21:43 PST 2004

Abstraction complete.

Wed Dec  8 03:36:10 PST 2004

Started work on abstracting pairing (the `pairing_t' data type).

Mon Dec  6 18:46:08 PST 2004

Minor fixes, cleanup. First release.

[0.0.0]

Wed Nov 24 03:20:31 PST 2004

Finally have a single program that starts with a given D and generates
a k=6 curve.

Tue Nov 23 19:08:21 PST 2004

Compute integral part of input to mpc_exp separately so that the Taylor
series converges quickly.

Tue Nov 23 01:51:51 PST 2004

Fixed bug in hilbert_poly (multiplcation by (X^2 - 2 Re(j)X + |j|^2) was
wrong).

Mon Nov 22 18:49:29 PST 2004

Integrating pell equation solver with hilbert poly code.

Fri Nov 19 14:36:18 PST 2004

hilbert_poly() works, but still need code to change the precision
of the computatons for higher D.

Fri Nov 19 04:21:05 PST 2004

Started work on computing Hilbert polys. Can compute j's, just need
to multiply them together and round to integers.

Is old code faster? Is it better to compute real exp, sin and cos functions
rather than one complex power series for complex exp()?

Wed Nov 17 23:11:38 PST 2004

Complex numbers. Miller's algorithm optimizations: can scale points by
any element of the base field due to final exponentiation, i.e. use
projective version of doubling and mixin.
Intend to modify original one so it works on embedding degree 1 curves.

Wed Nov 17 04:05:39 PST 2004

Finally found bug that was messing up Tate pairing.
v = v + b instead of v = v + c in miller_line()

Tue Nov  9 23:42:27 PST 2004

Bugfix: field_init_polymod assumes input polynomial is irreducible, but
poly_is_irred() calls this without caring.

Tue Nov  9 14:22:26 PST 2004

Fixed bug in random polynomial generator. Also in poly_irred test
code: it was only looking for GCD = +- 1, rather than GCD = any unit

Mon Nov  8 01:13:39 PST 2004

Implemented Cantor-Zassenhaus algorithm for finding square roots.
(Is this the same as Legendre's method?)

Thu Nov  4 14:33:06 PST 2004

Polynomial rings. (Perhaps need to rename "field" data structure to ring.)

Sun Oct 31 11:44:44 PST 2004

Very basic infrastructure. F_p implemented.
