A high level toolbox for computing some kind of factorizations in finite fields
(see the zen page overview)
The ZENFACT package is based on ZEN library, which is built on top of big integers arithmetics. Currently, two packages are supported:
- The BigNum package which is a licensed product by Digital Equipment Corporation & INRIA.
- The Gnu Mutliprecision library (GMP) which is distributed under the GNU general public license.
The ZENFACT package is distributed under the ZEN license.
- Zenfact: Provides an implementation of the Berlekamp's algorithm for testing irreducibility of a polynomial (see the documentation for more details).
The LaTeX sources of the documentation of the library are contained in the C sources. The command make doc provides a dvi file. You can also download a
postcript version of this documentation
(compressed version using gzip).
We have already intensively used the library to implement various applications.
Some of them are listed below.
- Tables of irreducible polynomials were obtained using Berlekamp's algorithm implementation.
- These tables are now completed by a web server running a ZEN based program:
PIPS, the Primitive and Irreducible Polynomial Server.
- True minimal distance of some BCH codes of length 511 (further explanations in this
paper).
You can also have a look at a small example involving different representations of GF(2n).
Last modified: 26 12 1998 16:49 MET