Problema căutării polinoamelor ireductibile asupra extensiei câmpurilor Galois

Abstract

In this work the solution of searching irreducible polynomials over extension Galois field is presented. The proposed algorithm is based on the trace generation and testing the subperiods resulted from factorization the field’s Euler indicator. Algorithm complexity is NPpolynomial. The searching results shows that the expected number of irreducible polynomials differ from the expected one known.