Description: Cryptographers use hard problems to construct unbreakable encryption schemes, pseudorandom number generators and more. A typical example is the factoring of large numbers, i.e., we learn in primary school how to multiply numbers, but given a large number, even supercomputers struggle to take it apart into its prime factors. In the talk, we will see the diversity of hard problems that are candidates for secure cryptography, ranging from factoring to sudoku. About the speaker: Christopher Brzuska is a faculty…