Normal and optimal normal bases in finite fields

Abstract

Arithmetic operations in finite fields have many applications in cryptography, coding theory, and computer algebra. The realization of these operations can often be made more efficient by the normal basis representation of the field elements. This thesis is aimed at giving a survey of recent results concerning normal bases and efficient ways of multiplication, inversion, and exponentiation when the normal basis representation is used.