|
Libecc is an elliptic curve crypto library for C++ developers.
It is currently in development.
|
|
|
|
14 Januari 2003
libecc 0.5.0 has been released.
This release includes all trinomials of degree less than 1200 that are irreducible
or primitive (for which factorization of 2^m - 1 is known).
Furthermore, it has been considerably speeded up by using the fastest known algorithm
and hand optimized assembly code for every crucial part of the library.
18 November 2002
libecc 0.4.0 has been released.
This release adds an implementation of a polynomial representation
of the field F2m
using a trinomial reduction polynomial of degree m.
Included are tools to check whether a given trinomial is irreducible and/or primitive.
A list of all irreducible trinomials of prime degree less than 1200 is provided.
20 October 2002
libecc 0.3.0 has been released.
This release adds an implementation of SHA-1 for bitsets.
The implementation was written from scratch but extensively tested using the
SHA-1 Sample Vectors
provided by NIST.
17 October 2002
libecc 0.2.1 has been released.
There was a file missing in the testsuite.
Only interesting if you want to run the testsuite of course.
16 October 2002
libecc 0.2.0 has been released.
This release includes a new pseudo random number generator (RNG) that never was released before.
The RNG passes the tests of the testsuites diehard,
ent and NIST.
25 September 2002
libecc 0.1.0 has been released.
This release adds a bitset.
28 July 2002
libecc 0.0.1 and 0.0.2 have been released.
These versions contain minor improvements of the build system, mostly related
to generating documentation.
27 July 2002
First public release of libecc on sourceforge.
|
|
|