I would like to know, if there are any intuitive fast approaches to finding generator elements of small finite extension fields. Like for example, i don't want to try every element of lets say
$\mathbb{F}_p$ and $F_q[x]$ where the coefficients of F are elements of $\mathbb{F}_p$ and $q = p^n$ with $n=2$ and $p=3$. How do i find the generator fast and efficiently for $F_q[x]$(should be obvious, but somehow it is not)? The elements in $F_q[x]$ namely 0 and 1 can not be solutions, but for example $\bigcup_{i=1}^q g^i = F_q[x]$ ... how do i find this g fast and efficiently, without just blindly guessing and trying elements?
This edit will probably be downvoted, but whatever ... this question is kind of easy to understand ... but sure, i'll edit it ...