I got the following task:
Let $F = GF(2^6 )$ be K[x] modulo the primitive polynomial $h(x) = 1 +x ^2 +x ^3 +x ^5 +x ^6$ , and let $\alpha$ be the class of x. I have a table with the binary representation of the elements of $GF(2^6 ) = \{0; 1; \alpha^1; \alpha^2 ; ...; \alpha^{62}\}$.
Is there a quicker way to check $\alpha^{52}$ than performing a long division of $x^{52}$ by $h(x)$ ?
It has $2^6$ elements so after $\alpha^{62}$ it will be back to 1 again, but maybe there is some trick to find it faster rather than performing such a long division?
I have also $\alpha^{13}$ so it's $\alpha^{13^4}$, but no idea how to use it
If you know the representation of $\alpha^{13}$ as a polynomial $a(x) \in \mathbb F_2[x]$ of degree $5$ or less, then the representation of $\alpha^{52} = (\alpha^{13})^4$ (not $\alpha^{13^4}$ the way you have written it) is just $$[a(x)]^4 \bmod h(x) = \left(\sum_{i=0}^5 a_i x^i\right)^4 \bmod h(x)= \sum_{i=0}^5 a_i x^{4i} \bmod h(x).$$ Reducing a degree-$20$ polynomial modulo $h(x)$ is faster than reducing a degree-$52$ polynomial.