We estimate the frequency of polynomial iterations which fall in a given multiplicative subgroup of a finite field of \begin{document}$ p $\end{document} elements. We also give a lower bound on the size of the subgroup which is multiplicatively generated by the first \begin{document}$ N $\end{document} elements in an orbit. We derive these from more general results about sequences of compositions on a fixed set of polynomials.