ZENFACT
A high level toolbox for computing some kind of factorizations in finite fields
The ZENFACT package is based on
ZEN
library, which is built on top of big integers arithmetics.
It provides an implementation of Miller-Rabin pseudo-primes test and the Berlekamp's algorithm for testing irreducibility of a polynomial (see the
documentation
for more details).
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).
The ZENFACT package is distributed under the
ZEN license
| 
