 enumeration algorithm for  0.  the irreducible polynomial over ${\mathbb{F}}_q$ and their roots in ${\mathbb{F}}_{q^n}$ in preprocessing time $O(n^{0+\epsilon}p^{0/0+\epsilon}+(\log q)^{0+\epsilon}n^{0+\epsilon}