# Model of polynomial over $GF(2^n)$ as polynomials over $GF(2)$

Let's say $F = GF(2^n)$ and $P(x) = x^e, P : F \rightarrow F$. Is there a way, not necessarily optimal, to write each bit of the output of $P$ as a function of input bits?