The notion of pseudo-randomness plays a very crucial role for (quasi-)Monte Carlo methods
but also in cryptography. For both applications, number theoretic constructions of high
quality pseudo-random number generators using finite fields have been very successful.
Finite fields are also of great importance in modern applications such as analysis of
algorithms, information and communication theory, signal processing and coding theory.