Multiplicative orders of elements in finite fields

For many applications in cryptography and coding theory it is important to find elements of high multiplicative order in a finite field. This motivates the search for upper and lower bounds on such multiplicative orders. In this talk, I will outline some such bounds which arise from counting certain partitions (for lower bounds) and the analytic class number formula (for upper bounds). This talk should be accessible to advanced undergraduate students.