News Archive 6

Mulitplicative subgroups are handled properly so that one can pick random elements and hash to G_T. Hopefully it should be more robust in general. The code is a bit messy though, and I plan to clean it up later.

Michael Cheng kindly sent me a modified version of PBC 0.4.7 which can be compiled using Microsoft Visual C++. I have made it available on the download page.

I have not tried it myself as I don’t have this particular compiler handy.

I patched a memory leak reported by Michael Cheng. I forgot to free a temporary variable when I added Lucas sequences (which speed up D and G pairings).

Applied patch by Joe Cooley that addresses configure.ac issues and fixes a bug in example/zss.c.

A fairly lowlevel bug had somehow escaped my attention for quite some time. Comparing zero elements previously returned the wrong result, due to a simple logic bug in montfp.c.

Simple final powering optimizations were applied to D and G pairings.