Mathematical Cryptography
This REU Site program includes research projects on the mathematics of cryptography. In particular, the participants will have the possibility to learn about modern asymmetric encryption schemes based on Euclidean lattices, isogenies, and error correcting codes. These new types of primitives are the subject of extremely active research at the intersection between theoretical computer science and pure mathematics. The participants will also have the opportunity to explore the connections between pure mathematics and block cipher design through so-called Almost Perfect Nonlinear functions. These are connected to computational Galois theory, which is an exciting area of research in computational algebra.