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