
Retour vers mes pages en langue française. 

In order to present ZEN functionnalities, I have created a server that computes irreducible and primitive polynomials on demand.


Thanks to the ZEN library, I have computed some
irreducible polynomials and trinomials.
If you need to build a Galois field, you may find a definition polynomial here. 

You will find here a list of my publications. Except my PhD thesis, all these publications are in english. 

You'll find here my unofficial page for software suspending under linux: or how to make your linux box have a nice sleep. 

I have put on line some hints and tricks for linux users.
It's now a couple of years since I have been using this system


Many computational problems need arithmetic operations in polynomial
finite rings over Z/nZ, where n is an integer (n>1). This library
provides efficient operations for applications such as integer
factorization and primality testing.
