It has programs written on Singular CAS to process irreducible polynomials over finite fields.
It includes:
a) Rabin's irreducibility test.
b) BenOr's irreducibility test.<br
c) Order of a polynomial.
d) Mobius function.
e) Number of irreducible polynomials using Order and degree of polynomials.
f) Number of irreducible polynomials of a given degree.
g) Nth Cyclotomic polynomial.
h) Product of irreducible polynomials of a given degree over a ring of some characteristics.
i) Multiplicative function test for an integer.
j) Fast modular arithmetic.
k) List related functions like list membership and delete duplicates.
l) Find specific Cyclotomic polynomials whose product is equal to product of irreducible polynomials in a field.