So I'm working through Koblitz'z "a course in number theory and cryptography" when I came across his proof that every finite field has a generator (ie, There is an element such that the multiplicative group generated by this element are all the units of the field). This implies that the multiplicative group of any finite field is cyclic. So this got me thinking about a number of things. The first being, since the proof only relies on multiplicative commutativity and finiteness, is every finite abelian group cyclic? If not, then there must be a restriction on what finite abelian groups can possibly be the multiplicative group of some finite field. The proof is on page 34 for anyone that has a copy and wants to shed some light on the matter. I'm really just trying to understand what additional structure multiplicative groups of finite fields are endowed with that arbitrary finite abelian groups lack.
Thanks! -wrote using ipad; beware of typos!
The proof must rely on the severe limitations of solutions of polynomials equations in a field: A polynomials of degree $n$ over a field has at most $n$ different solutions in it (in your case probably applied to polynomials of the form $x^d-1$). Arbitrary abelian groups don't pose such limitations on solutions to equations of the form $x^d=e$, which is why the proof fails. Indeed, in the Klein group $\mathbb Z_2\times \mathbb Z_2$, there are four solutions to the equation $x^2=e$, and of course the Klein group is the (smallest) non-cyclic abelian group.
By the way, basically the same proof showing that the multiplicative group of a finite fieled is cyclic shows the stronger result that any finite subgroup of the multiplicative group of any field (finite or not) is cyclic.