Mappings of finite fields play an important role in many applications like coding theory, combinatorics, cryptology or finite geometry. In this article we survey recent progress on classification and explicit constructions of almost perfect nonlinear, bent, crooked mappings and those having a linear structure. We present the switching method, which proved itself as a powerful tool for constructing mappings satisfying additive properties. We describe main open challenges in this research area.