A Fast Algorithm To Compute Irreducible and Primitive Polynomials in Finite Fields.

Josep Rifà Joan Borrell A Fast Algorithm To Compute Irreducible and Primitive Polynomials in Finite Fields. 13-20 1995 28 1 Math. Syst. Theory db/journals/mst/mst28.html#RifaB95 https://doi.org/10.1007/BF01294593